Base | Representation |
---|---|
bin | 11110110111010111010… |
… | …000001001011011100100 |
3 | 21111202202020112121200121 |
4 | 132313113100021123210 |
5 | 234222332213230200 |
6 | 4302215434251324 |
7 | 306145051216660 |
oct | 36672720113344 |
9 | 7452666477617 |
10 | 2121030211300 |
11 | 748584293a00 |
12 | 2a30a0886b44 |
13 | 125021005b10 |
14 | 749309698a0 |
15 | 3a28d630e1a |
hex | 1edd74096e4 |
2121030211300 has 216 divisors, whose sum is σ = 6226582042688. Its totient is φ = 610246137600.
The previous prime is 2121030211283. The next prime is 2121030211309. The reversal of 2121030211300 is 31120301212.
It is not an unprimeable number, because it can be changed into a prime (2121030211309) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 137959 + ... + 2064241.
Almost surely, 22121030211300 is an apocalyptic number.
2121030211300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2121030211300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3113291021344).
2121030211300 is an abundant number, since it is smaller than the sum of its proper divisors (4105551831388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2121030211300 is a wasteful number, since it uses less digits than its factorization.
2121030211300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1926339 (or 1926321 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2121030211300 its reverse (31120301212), we get a palindrome (2152150512512).
The spelling of 2121030211300 in words is "two trillion, one hundred twenty-one billion, thirty million, two hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •