Base | Representation |
---|---|

bin | 10110100100110101… |

… | …01011100010101001 |

3 | 1011021200012002222202 |

4 | 23102122223202221 |

5 | 144310224102131 |

6 | 5322400425545 |

7 | 606230344625 |

oct | 132232534251 |

9 | 34250162882 |

10 | 12120144041 |

11 | 515a561675 |

12 | 24230182b5 |

13 | 11b200c185 |

14 | 82d974185 |

15 | 4ae0a3bcb |

hex | 2d26ab8a9 |

12120144041 has 2 divisors, whose sum is σ = 12120144042. Its totient is φ = 12120144040.

The previous prime is 12120144037. The next prime is 12120144079. The reversal of 12120144041 is 14044102121.

12120144041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12104620441 + 15523600 = 110021^2 + 3940^2 .

It is a cyclic number.

It is not a de Polignac number, because 12120144041 - 2^{2} = 12120144037 is a prime.

It is not a weakly prime, because it can be changed into another prime (12120144031) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6060072020 + 6060072021.

It is an arithmetic number, because the mean of its divisors is an integer number (6060072021).

Almost surely, 2^{12120144041} is an apocalyptic number.

It is an amenable number.

12120144041 is a deficient number, since it is larger than the sum of its proper divisors (1).

12120144041 is an equidigital number, since it uses as much as digits as its factorization.

12120144041 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 256, while the sum is 20.

Adding to 12120144041 its reverse (14044102121), we get a palindrome (26164246162).

The spelling of 12120144041 in words is "twelve billion, one hundred twenty million, one hundred forty-four thousand, forty-one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •