Base | Representation |
---|---|
bin | 11110110111011101010… |
… | …101010000001101101100 |
3 | 21111210000100110211212001 |
4 | 132313131111100031230 |
5 | 234223034321304400 |
6 | 4302233520422044 |
7 | 306150430220215 |
oct | 36673525201554 |
9 | 7453010424761 |
10 | 2121132213100 |
11 | 74862692240a |
12 | 2a310aa77924 |
13 | 12503919a804 |
14 | 7494031c40c |
15 | 3a29757da6a |
hex | 1eddd55036c |
2121132213100 has 72 divisors (see below), whose sum is σ = 4815081377568. Its totient is φ = 809519040000.
The previous prime is 2121132213097. The next prime is 2121132213139. The reversal of 2121132213100 is 13122311212.
It is a super-2 number, since 2×21211322131002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 248401 + ... + 2074600.
It is an arithmetic number, because the mean of its divisors is an integer number (66876130244).
Almost surely, 22121132213100 is an apocalyptic number.
2121132213100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2121132213100 is an abundant number, since it is smaller than the sum of its proper divisors (2693949164468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2121132213100 is a wasteful number, since it uses less digits than its factorization.
2121132213100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2323435 (or 2323428 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2121132213100 its reverse (13122311212), we get a palindrome (2134254524312).
The spelling of 2121132213100 in words is "two trillion, one hundred twenty-one billion, one hundred thirty-two million, two hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •