Base | Representation |
---|---|
bin | 1011101001001000111… |
… | …1011000000110001100 |
3 | 201010021212200101211200 |
4 | 2322102033120012030 |
5 | 11234121113000022 |
6 | 231515553345500 |
7 | 20310505642662 |
oct | 2722217300614 |
9 | 633255611750 |
10 | 200022000012 |
11 | 7791322812a |
12 | 32922b68290 |
13 | 15b28a52a33 |
14 | 9976daac32 |
15 | 530a36cbac |
hex | 2e923d818c |
200022000012 has 36 divisors (see below), whose sum is σ = 507533666640. Its totient is φ = 66420483552.
The previous prime is 200022000001. The next prime is 200022000023. The reversal of 200022000012 is 210000220002.
It is an interprime number because it is at equal distance from previous prime (200022000001) and next prime (200022000023).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 200021999958 and 200022000003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10553587 + ... + 10572522.
Almost surely, 2200022000012 is an apocalyptic number.
It is an amenable number.
200022000012 is an abundant number, since it is smaller than the sum of its proper divisors (307511666628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200022000012 is a wasteful number, since it uses less digits than its factorization.
200022000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21126382 (or 21126377 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 200022000012 its reverse (210000220002), we get a palindrome (410022220014).
The spelling of 200022000012 in words is "two hundred billion, twenty-two million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •