Base | Representation |
---|---|
bin | 1010111011001000100010… |
… | …0110010101101010111110 |
3 | 1120112020112122201220210122 |
4 | 2232302020212111222332 |
5 | 3033242032144424410 |
6 | 41313441521334542 |
7 | 2346524165061533 |
oct | 256621046255276 |
9 | 46466478656718 |
10 | 12011020311230 |
11 | 3910932925836 |
12 | 141b996497452 |
13 | 6918328a91c5 |
14 | 2d749d458d8a |
15 | 15c67a672e55 |
hex | aec88995abe |
12011020311230 has 32 divisors (see below), whose sum is σ = 21671869615200. Its totient is φ = 4792854298752.
The previous prime is 12011020311151. The next prime is 12011020311253. The reversal of 12011020311230 is 3211302011021.
It is a super-2 number, since 2×120110203112302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12011020311199 and 12011020311208.
It is a congruent number.
It is an unprimeable number.
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, 10045736 + ... + 11177604.
It is an arithmetic number, because the mean of its divisors is an integer number (677245925475).
Almost surely, 212011020311230 is an apocalyptic number.
12011020311230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12011020311230 is a deficient number, since it is larger than the sum of its proper divisors (9660849303970).
12011020311230 is a wasteful number, since it uses less digits than its factorization.
12011020311230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134428.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12011020311230 its reverse (3211302011021), we get a palindrome (15222322322251).
The spelling of 12011020311230 in words is "twelve trillion, eleven billion, twenty million, three hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •