Base | Representation |
---|---|
bin | 101111101111111011110010… |
… | …100010111000101110000000 |
3 | 1000112120000101101221011021220 |
4 | 233233323302202320232000 |
5 | 210011134001222431422 |
6 | 2022345402352315040 |
7 | 62143105201252413 |
oct | 5757736242705600 |
9 | 1015500341834256 |
10 | 210002200202112 |
11 | 60a054842a481a |
12 | 1b6779bbb42a80 |
13 | 90241791b9a36 |
14 | 39c0237043b7a |
15 | 194298c23de5c |
hex | befef28b8b80 |
210002200202112 has 32 divisors (see below), whose sum is σ = 557818344287880. Its totient is φ = 70000733400576.
The previous prime is 210002200202077. The next prime is 210002200202117. The reversal of 210002200202112 is 211202002200012.
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 210002200202091 and 210002200202100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210002200202117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 273440364463 + ... + 273440365230.
Almost surely, 2210002200202112 is an apocalyptic number.
It is an amenable number.
210002200202112 is an abundant number, since it is smaller than the sum of its proper divisors (347816144085768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210002200202112 is an equidigital number, since it uses as much as digits as its factorization.
210002200202112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546880729710 (or 546880729698 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 210002200202112 its reverse (211202002200012), we get a palindrome (421204202402124).
The spelling of 210002200202112 in words is "two hundred ten trillion, two billion, two hundred million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •