Base | Representation |
---|---|
bin | 1010111011101110110101… |
… | …1111110000111000110111 |
3 | 1120120020002021110200222100 |
4 | 2232323231133300320313 |
5 | 3033424112033133421 |
6 | 41322302123433143 |
7 | 2350340044501536 |
oct | 256735537607067 |
9 | 46506067420870 |
10 | 12021303021111 |
11 | 391522a18497a |
12 | 14219860857b3 |
13 | 6927b101c617 |
14 | 2d7b96d7031d |
15 | 15ca7d276c26 |
hex | aeeed7f0e37 |
12021303021111 has 24 divisors (see below), whose sum is σ = 17374166334720. Its totient is φ = 8009558693136.
The previous prime is 12021303021067. The next prime is 12021303021137. The reversal of 12021303021111 is 11112030312021.
12021303021111 is a `hidden beast` number, since 120 + 2 + 130 + 302 + 1 + 111 = 666.
It is not a de Polignac number, because 12021303021111 - 213 = 12021303012919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021303022111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 357260290 + ... + 357293936.
It is an arithmetic number, because the mean of its divisors is an integer number (723923597280).
Almost surely, 212021303021111 is an apocalyptic number.
12021303021111 is a deficient number, since it is larger than the sum of its proper divisors (5352863313609).
12021303021111 is a wasteful number, since it uses less digits than its factorization.
12021303021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55475 (or 55472 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 12021303021111 its reverse (11112030312021), we get a palindrome (23133333333132).
The spelling of 12021303021111 in words is "twelve trillion, twenty-one billion, three hundred three million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •