Base | Representation |
---|---|
bin | 1010111011001101010100… |
… | …0011011010000111001101 |
3 | 1120112100212001100021000121 |
4 | 2232303111003122013031 |
5 | 3033302144032000023 |
6 | 41314213102024541 |
7 | 2346601031542141 |
oct | 256632503320715 |
9 | 46470761307017 |
10 | 12012303000013 |
11 | 3911430979908 |
12 | 1420093b78151 |
13 | 6919a8562854 |
14 | 2d7581951221 |
15 | 15c703093d5d |
hex | aecd50da1cd |
12012303000013 has 8 divisors (see below), whose sum is σ = 12156938725568. Its totient is φ = 11868205955904.
The previous prime is 12012302999999. The next prime is 12012303000037. The reversal of 12012303000013 is 31000030321021.
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 12012303000013 - 225 = 12012269445581 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 (12012303000083) 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 7 ways as a sum of consecutive naturals, for example, 134625495 + ... + 134714692.
It is an arithmetic number, because the mean of its divisors is an integer number (1519617340696).
Almost surely, 212012303000013 is an apocalyptic number.
It is an amenable number.
12012303000013 is a deficient number, since it is larger than the sum of its proper divisors (144635725555).
12012303000013 is a wasteful number, since it uses less digits than its factorization.
12012303000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269340723.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 12012303000013 its reverse (31000030321021), we get a palindrome (43012333321034).
The spelling of 12012303000013 in words is "twelve trillion, twelve billion, three hundred three million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •