Base | Representation |
---|---|
bin | 1010111011101110100100… |
… | …1001101110000000110100 |
3 | 1120120012220012022121200210 |
4 | 2232323221021232000310 |
5 | 3033423434403231200 |
6 | 41322251001305420 |
7 | 2350335201116613 |
oct | 256735111560064 |
9 | 46505805277623 |
10 | 12021230133300 |
11 | 39151a2021213 |
12 | 1421965795270 |
13 | 69279bbac53b |
14 | 2d7b8b3d987a |
15 | 15ca76b7a650 |
hex | aeee926e034 |
12021230133300 has 72 divisors (see below), whose sum is σ = 35521456231296. Its totient is φ = 3137455804160.
The previous prime is 12021230133247. The next prime is 12021230133317. The reversal of 12021230133300 is 333103212021.
12021230133300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 426270657 + ... + 426298856.
It is an arithmetic number, because the mean of its divisors is an integer number (493353558768).
Almost surely, 212021230133300 is an apocalyptic number.
12021230133300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12021230133300 is an abundant number, since it is smaller than the sum of its proper divisors (23500226097996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021230133300 is a wasteful number, since it uses less digits than its factorization.
12021230133300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 852569577 (or 852569570 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12021230133300 its reverse (333103212021), we get a palindrome (12354333345321).
The spelling of 12021230133300 in words is "twelve trillion, twenty-one billion, two hundred thirty million, one hundred thirty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •