Base | Representation |
---|---|
bin | 1010111011101101110000… |
… | …1010000010001010001101 |
3 | 1120120012100000001222201022 |
4 | 2232323130022002022031 |
5 | 3033423013100041023 |
6 | 41322213212323525 |
7 | 2350326613014212 |
oct | 256733412021215 |
9 | 46505300058638 |
10 | 12021012112013 |
11 | 391509aa4a633 |
12 | 14219047735a5 |
13 | 692765985668 |
14 | 2d7b6a485b09 |
15 | 15ca629617c8 |
hex | aeedc28228d |
12021012112013 has 8 divisors (see below), whose sum is σ = 12072962611008. Its totient is φ = 11969064674784.
The previous prime is 12021012111929. The next prime is 12021012112033. The reversal of 12021012112013 is 31021121012021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12021012112013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12021012111982 and 12021012112000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021012112033) 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, 7286456 + ... + 8782622.
It is an arithmetic number, because the mean of its divisors is an integer number (1509120326376).
Almost surely, 212021012112013 is an apocalyptic number.
It is an amenable number.
12021012112013 is a deficient number, since it is larger than the sum of its proper divisors (51950498995).
12021012112013 is a wasteful number, since it uses less digits than its factorization.
12021012112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1530883.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12021012112013 its reverse (31021121012021), we get a palindrome (43042133124034).
The spelling of 12021012112013 in words is "twelve trillion, twenty-one billion, twelve million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •