Base | Representation |
---|---|
bin | 1010111011001010000000… |
… | …0000110000011001101101 |
3 | 1120112021120000212021202012 |
4 | 2232302200000300121231 |
5 | 3033243333224044204 |
6 | 41313544512411005 |
7 | 2346540004611533 |
oct | 256624000603155 |
9 | 46467500767665 |
10 | 12011413112429 |
11 | 3911014624125 |
12 | 141ba85b46a65 |
13 | 691896099c53 |
14 | 2d74d96a8153 |
15 | 15c69edb376e |
hex | aeca003066d |
12011413112429 has 2 divisors, whose sum is σ = 12011413112430. Its totient is φ = 12011413112428.
The previous prime is 12011413112393. The next prime is 12011413112431. The reversal of 12011413112429 is 92421131411021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11463628096804 + 547785015625 = 3385798^2 + 740125^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011413112429 - 28 = 12011413112173 is a prime.
Together with 12011413112431, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12011413112395 and 12011413112404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011413114429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005706556214 + 6005706556215.
It is an arithmetic number, because the mean of its divisors is an integer number (6005706556215).
Almost surely, 212011413112429 is an apocalyptic number.
It is an amenable number.
12011413112429 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011413112429 is an equidigital number, since it uses as much as digits as its factorization.
12011413112429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 32.
The spelling of 12011413112429 in words is "twelve trillion, eleven billion, four hundred thirteen million, one hundred twelve thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •