Base | Representation |
---|---|
bin | 11101010010000001000… |
… | …111110110001000011000 |
3 | 21010100212110000112112020 |
4 | 131102001013312020120 |
5 | 230432002004341440 |
6 | 4140221425214440 |
7 | 265243315252341 |
oct | 35220107661030 |
9 | 7110773015466 |
10 | 2012211012120 |
11 | 706412726a41 |
12 | 285b91491420 |
13 | 11799b33a62a |
14 | 6d56a5190c8 |
15 | 375200303d0 |
hex | 1d4811f6218 |
2012211012120 has 32 divisors (see below), whose sum is σ = 6036633036720. Its totient is φ = 536589603200.
The previous prime is 2012211012103. The next prime is 2012211012157. The reversal of 2012211012120 is 212101122102.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2012211012120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8384212431 + ... + 8384212670.
Almost surely, 22012211012120 is an apocalyptic number.
2012211012120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2012211012120 is an abundant number, since it is smaller than the sum of its proper divisors (4024422024600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012211012120 is a wasteful number, since it uses less digits than its factorization.
2012211012120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16768425115 (or 16768425111 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2012211012120 its reverse (212101122102), we get a palindrome (2224312134222).
The spelling of 2012211012120 in words is "two trillion, twelve billion, two hundred eleven million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •