Base | Representation |
---|---|
bin | 11110111000010001110… |
… | …101100100111110110000 |
3 | 21111212021202000122020212 |
4 | 132320101311210332300 |
5 | 234231340323231000 |
6 | 4302501145123252 |
7 | 306211314521351 |
oct | 36702165447660 |
9 | 7455252018225 |
10 | 2122013102000 |
11 | 748a39091270 |
12 | 2a3315a89528 |
13 | 12514983254c |
14 | 749c5301d28 |
15 | 3a2e9a82c35 |
hex | 1ee11d64fb0 |
2122013102000 has 160 divisors (see below), whose sum is σ = 5599524161088. Its totient is φ = 771360000000.
The previous prime is 2122013101903. The next prime is 2122013102003. The reversal of 2122013102000 is 2013102212.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (2122013102003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66005930 + ... + 66038070.
Almost surely, 22122013102000 is an apocalyptic number.
2122013102000 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 2122013102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2799762080544).
2122013102000 is an abundant number, since it is smaller than the sum of its proper divisors (3477511059088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122013102000 is a wasteful number, since it uses less digits than its factorization.
2122013102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35176 (or 35160 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2122013102000 its reverse (2013102212), we get a palindrome (2124026204212).
The spelling of 2122013102000 in words is "two trillion, one hundred twenty-two billion, thirteen million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •