Base | Representation |
---|---|
bin | 1011000000111001110010… |
… | …1110000000001010111001 |
3 | 1120212201101121220010210021 |
4 | 2300032130232000022321 |
5 | 3041403032340044231 |
6 | 41431153353450441 |
7 | 2356633416351652 |
oct | 260163456001271 |
9 | 46781347803707 |
10 | 12110142112441 |
11 | 394997856a10a |
12 | 143703a110a21 |
13 | 69ac9b486499 |
14 | 2dc1c39d6529 |
15 | 16002c73a811 |
hex | b039cb802b9 |
12110142112441 has 2 divisors, whose sum is σ = 12110142112442. Its totient is φ = 12110142112440.
The previous prime is 12110142112433. The next prime is 12110142112457. The reversal of 12110142112441 is 14421124101121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11603050005625 + 507092106816 = 3406325^2 + 712104^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110142112441 - 23 = 12110142112433 is a prime.
It is not a weakly prime, because it can be changed into another prime (12110142112421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055071056220 + 6055071056221.
It is an arithmetic number, because the mean of its divisors is an integer number (6055071056221).
Almost surely, 212110142112441 is an apocalyptic number.
It is an amenable number.
12110142112441 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110142112441 is an equidigital number, since it uses as much as digits as its factorization.
12110142112441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 25.
Adding to 12110142112441 its reverse (14421124101121), we get a palindrome (26531266213562).
The spelling of 12110142112441 in words is "twelve trillion, one hundred ten billion, one hundred forty-two million, one hundred twelve thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •