Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …111001010101010000110000 |
3 | 1000112120000011222011020122221 |
4 | 233233323231321111100300 |
5 | 210011133321240400422 |
6 | 2022345350524410424 |
7 | 62143103233250344 |
oct | 5757735571252060 |
9 | 1015500158136587 |
10 | 210002122200112 |
11 | 60a05444268760 |
12 | 1b6779999a6a14 |
13 | 9024165ca8bc8 |
14 | 39c022a93b624 |
15 | 19429854823c7 |
hex | befeede55430 |
210002122200112 has 40 divisors (see below), whose sum is σ = 443899716939072. Its totient is φ = 95448715464000.
The previous prime is 210002122200083. The next prime is 210002122200151. The reversal of 210002122200112 is 211002221200012.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39986418 + ... + 44932369.
Almost surely, 2210002122200112 is an apocalyptic number.
210002122200112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
210002122200112 is an abundant number, since it is smaller than the sum of its proper divisors (233897594738960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210002122200112 is a wasteful number, since it uses less digits than its factorization.
210002122200112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84932857 (or 84932851 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210002122200112 its reverse (211002221200012), we get a palindrome (421004343400124).
The spelling of 210002122200112 in words is "two hundred ten trillion, two billion, one hundred twenty-two million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •