Base | Representation |
---|---|
bin | 1011101001000110100… |
… | …1010001011011010101 |
3 | 201010021011212220210110 |
4 | 2322101221101123111 |
5 | 11234111033324341 |
6 | 231514555313233 |
7 | 20310325021101 |
oct | 2722151213325 |
9 | 633234786713 |
10 | 200012011221 |
11 | 77908625430 |
12 | 3291b74b819 |
13 | 15b269662c9 |
14 | 997592a901 |
15 | 5309548216 |
hex | 2e91a516d5 |
200012011221 has 64 divisors (see below), whose sum is σ = 315748408320. Its totient is φ = 111297576960.
The previous prime is 200012011193. The next prime is 200012011237. The reversal of 200012011221 is 122110210002.
200012011221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 200012011221 - 210 = 200012010197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200012011197 and 200012011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200012011621) 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 63 ways as a sum of consecutive naturals, for example, 5945370 + ... + 5978916.
It is an arithmetic number, because the mean of its divisors is an integer number (4933568880).
Almost surely, 2200012011221 is an apocalyptic number.
It is an amenable number.
200012011221 is a deficient number, since it is larger than the sum of its proper divisors (115736397099).
200012011221 is a wasteful number, since it uses less digits than its factorization.
200012011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33874.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200012011221 its reverse (122110210002), we get a palindrome (322122221223).
The spelling of 200012011221 in words is "two hundred billion, twelve million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •