Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …110101100001000111111000 |
3 | 1000112120000011220021102221012 |
4 | 233233323231311201013320 |
5 | 210011133321011400440 |
6 | 2022345350451133052 |
7 | 62143103221614044 |
oct | 5757735565410770 |
9 | 1015500156242835 |
10 | 210002121200120 |
11 | 60a05443745417 |
12 | 1b6779995a4188 |
13 | 9024165a189b2 |
14 | 39c022a75b024 |
15 | 1942985335e65 |
hex | befeedd611f8 |
210002121200120 has 32 divisors (see below), whose sum is σ = 472506380845200. Its totient is φ = 84000562587648.
The previous prime is 210002121200087. The next prime is 210002121200161. The reversal of 210002121200120 is 21002121200012.
It is a junction number, because it is equal to n+sod(n) for n = 210002121200095 and 210002121200104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3167951 + ... + 20737409.
Almost surely, 2210002121200120 is an apocalyptic number.
210002121200120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210002121200120 is an abundant number, since it is smaller than the sum of its proper divisors (262504259645080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210002121200120 is a wasteful number, since it uses less digits than its factorization.
210002121200120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17868287 (or 17868283 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 210002121200120 its reverse (21002121200012), we get a palindrome (231004242400132).
The spelling of 210002121200120 in words is "two hundred ten trillion, two billion, one hundred twenty-one million, two hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •