Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …110001110100110100010100 |
3 | 1000112120000011211110021012202 |
4 | 233233323231301310310110 |
5 | 210011133320234412322 |
6 | 2022345350414304032 |
7 | 62143103210443130 |
oct | 5757735561646424 |
9 | 1015500154407182 |
10 | 210002120232212 |
11 | 60a054431441a0 |
12 | 1b6779991b8018 |
13 | 902416576a279 |
14 | 39c022a5883c0 |
15 | 19429851e4292 |
hex | befeedc74d14 |
210002120232212 has 96 divisors (see below), whose sum is σ = 467853218300160. Its totient is φ = 80109160427520.
The previous prime is 210002120232199. The next prime is 210002120232217. The reversal of 210002120232212 is 212232021200012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210002120232217) 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, 31007537 + ... + 37168152.
It is an arithmetic number, because the mean of its divisors is an integer number (4873471023960).
Almost surely, 2210002120232212 is an apocalyptic number.
210002120232212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
210002120232212 is an abundant number, since it is smaller than the sum of its proper divisors (257851098067948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210002120232212 is a wasteful number, since it uses less digits than its factorization.
210002120232212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68175921 (or 68175919 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 210002120232212 its reverse (212232021200012), we get a palindrome (422234141432224).
The spelling of 210002120232212 in words is "two hundred ten trillion, two billion, one hundred twenty million, two hundred thirty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •