Base | Representation |
---|---|
bin | 1010111010100000010001… |
… | …0001001010001111101100 |
3 | 1120111012122021200000021221 |
4 | 2232220010101022033230 |
5 | 3033102412304413200 |
6 | 41304453120033124 |
7 | 2345662252654453 |
oct | 256500421121754 |
9 | 46435567600257 |
10 | 12000210232300 |
11 | 3907295916504 |
12 | 141987a1627a4 |
13 | 6907cc11a3b4 |
14 | 2d6b558a5b9a |
15 | 15c2465eb91a |
hex | aea0444a3ec |
12000210232300 has 36 divisors (see below), whose sum is σ = 26052792264576. Its totient is φ = 4797810164800.
The previous prime is 12000210232271. The next prime is 12000210232301. The reversal of 12000210232300 is 323201200021.
It is not an unprimeable number, because it can be changed into a prime (12000210232301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28211947 + ... + 28634146.
It is an arithmetic number, because the mean of its divisors is an integer number (723688674016).
Almost surely, 212000210232300 is an apocalyptic number.
12000210232300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12000210232300 is an abundant number, since it is smaller than the sum of its proper divisors (14052582032276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000210232300 is a wasteful number, since it uses less digits than its factorization.
12000210232300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56848218 (or 56848211 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 12000210232300 its reverse (323201200021), we get a palindrome (12323411432321).
The spelling of 12000210232300 in words is "twelve trillion, two hundred ten million, two hundred thirty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •