Base | Representation |
---|---|
bin | 1010111011101110000110… |
… | …0100110111010000001111 |
3 | 1120120012120100011011112201 |
4 | 2232323201210313100033 |
5 | 3033423204334000221 |
6 | 41322230221142331 |
7 | 2350332065556103 |
oct | 256734144672017 |
9 | 46505510134481 |
10 | 12021103031311 |
11 | 39151372a9650 |
12 | 142192b0ba9a7 |
13 | 69277b769b6a |
14 | 2d7b78591903 |
15 | 15ca6a920891 |
hex | aeee193740f |
12021103031311 has 8 divisors (see below), whose sum is σ = 13113967774464. Its totient is φ = 10928244487320.
The previous prime is 12021103031303. The next prime is 12021103031363. The reversal of 12021103031311 is 11313030112021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12021103031311 - 23 = 12021103031303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021103031111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3115386 + ... + 5809288.
It is an arithmetic number, because the mean of its divisors is an integer number (1639245971808).
Almost surely, 212021103031311 is an apocalyptic number.
12021103031311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12021103031311 is a deficient number, since it is larger than the sum of its proper divisors (1092864743153).
12021103031311 is a wasteful number, since it uses less digits than its factorization.
12021103031311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3099581.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 12021103031311 its reverse (11313030112021), we get a palindrome (23334133143332).
The spelling of 12021103031311 in words is "twelve trillion, twenty-one billion, one hundred three million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •