Base | Representation |
---|---|
bin | 1011000000111110001001… |
… | …0110000001101000000101 |
3 | 1120212211102000220202200012 |
4 | 2300033202112001220011 |
5 | 3041412430404411234 |
6 | 41431505322400005 |
7 | 2360004362250356 |
oct | 260174226015005 |
9 | 46784360822605 |
10 | 12111310232069 |
11 | 394a417980734 |
12 | 1437305360005 |
13 | 69b126497b29 |
14 | 2dc294bc7d2d |
15 | 16009a07a0ce |
hex | b03e2581a05 |
12111310232069 has 2 divisors, whose sum is σ = 12111310232070. Its totient is φ = 12111310232068.
The previous prime is 12111310231981. The next prime is 12111310232111. The reversal of 12111310232069 is 96023201311121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10781700602500 + 1329609629569 = 3283550^2 + 1153087^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111310232069 is a prime.
It is a super-2 number, since 2×121113102320692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12111310232869) 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, 6055655116034 + 6055655116035.
It is an arithmetic number, because the mean of its divisors is an integer number (6055655116035).
Almost surely, 212111310232069 is an apocalyptic number.
It is an amenable number.
12111310232069 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111310232069 is an equidigital number, since it uses as much as digits as its factorization.
12111310232069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 32.
The spelling of 12111310232069 in words is "twelve trillion, one hundred eleven billion, three hundred ten million, two hundred thirty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •