Base | Representation |
---|---|
bin | 11110110110100001000… |
… | …000101110111110001100 |
3 | 21111200101211012022101010 |
4 | 132312201000232332030 |
5 | 234214001232413400 |
6 | 4301545245445220 |
7 | 306113361240006 |
oct | 36664100567614 |
9 | 7450354168333 |
10 | 2120120201100 |
11 | 748157644860 |
12 | 2a2a87b70810 |
13 | 124c07616045 |
14 | 74885b65376 |
15 | 3a2387c8450 |
hex | 1eda102ef8c |
2120120201100 has 72 divisors (see below), whose sum is σ = 6691870317888. Its totient is φ = 513968532800.
The previous prime is 2120120201081. The next prime is 2120120201183. The reversal of 2120120201100 is 11020210212.
It is a super-2 number, since 2×21201202011002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 321227034 + ... + 321233633.
It is an arithmetic number, because the mean of its divisors is an integer number (92942643304).
Almost surely, 22120120201100 is an apocalyptic number.
2120120201100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2120120201100 is an abundant number, since it is smaller than the sum of its proper divisors (4571750116788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2120120201100 is a wasteful number, since it uses less digits than its factorization.
2120120201100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642460695 (or 642460688 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2120120201100 its reverse (11020210212), we get a palindrome (2131140411312).
The spelling of 2120120201100 in words is "two trillion, one hundred twenty billion, one hundred twenty million, two hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •