Base | Representation |
---|---|
bin | 1010111011101110000110… |
… | …0101100110001000001111 |
3 | 1120120012120100111220220211 |
4 | 2232323201211212020033 |
5 | 3033423204411121221 |
6 | 41322230225223251 |
7 | 2350332100315630 |
oct | 256734145461017 |
9 | 46505510456824 |
10 | 12021103223311 |
11 | 391513741a926 |
12 | 142192b191b27 |
13 | 69277b806380 |
14 | 2d7b78601887 |
15 | 15ca6a95c6e1 |
hex | aeee196620f |
12021103223311 has 16 divisors (see below), whose sum is σ = 15139278482944. Its totient is φ = 9290011790304.
The previous prime is 12021103223291. The next prime is 12021103223347. The reversal of 12021103223311 is 11332230112021.
It is not a de Polignac number, because 12021103223311 - 27 = 12021103223183 is a prime.
It is a super-2 number, since 2×120211032233112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021103263311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1536043011 + ... + 1536050836.
It is an arithmetic number, because the mean of its divisors is an integer number (946204905184).
Almost surely, 212021103223311 is an apocalyptic number.
12021103223311 is a deficient number, since it is larger than the sum of its proper divisors (3118175259633).
12021103223311 is a wasteful number, since it uses less digits than its factorization.
12021103223311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3072093910.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12021103223311 its reverse (11332230112021), we get a palindrome (23353333335332).
The spelling of 12021103223311 in words is "twelve trillion, twenty-one billion, one hundred three million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •