Base | Representation |
---|---|
bin | 1011101001001000111… |
… | …1011011000011000101 |
3 | 201010021212201000102102 |
4 | 2322102033123003011 |
5 | 11234121113341401 |
6 | 231515553521445 |
7 | 20310506023142 |
oct | 2722217330305 |
9 | 633255630372 |
10 | 200022012101 |
11 | 7791323621a |
12 | 32922b73285 |
13 | 15b28a583a2 |
14 | 9976db13c9 |
15 | 530a37156b |
hex | 2e923db0c5 |
200022012101 has 16 divisors (see below), whose sum is σ = 211587199488. Its totient is φ = 188779814400.
The previous prime is 200022012049. The next prime is 200022012109. The reversal of 200022012101 is 101210220002.
It is a happy number.
200022012101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200022012101 - 226 = 199954903237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022012109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3654926 + ... + 3709248.
It is an arithmetic number, because the mean of its divisors is an integer number (13224199968).
Almost surely, 2200022012101 is an apocalyptic number.
It is an amenable number.
200022012101 is a deficient number, since it is larger than the sum of its proper divisors (11565187387).
200022012101 is a wasteful number, since it uses less digits than its factorization.
200022012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57292.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200022012101 its reverse (101210220002), we get a palindrome (301232232103).
The spelling of 200022012101 in words is "two hundred billion, twenty-two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •