Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …011100101000110101010011 |
3 | 222020212220112202211111022210 |
4 | 231201130102130220311103 |
5 | 202220221002230001321 |
6 | 1545451144543203203 |
7 | 60112465433661135 |
oct | 5541342234506523 |
9 | 866786482744283 |
10 | 200210210000211 |
11 | 5887a745091854 |
12 | 1a5560b62a6503 |
13 | 87939849444a8 |
14 | 3762323ad1055 |
15 | 1822dd8a53b76 |
hex | b61712728d53 |
200210210000211 has 8 divisors (see below), whose sum is σ = 282649708235664. Its totient is φ = 125622092549120.
The previous prime is 200210210000159. The next prime is 200210210000257. The reversal of 200210210000211 is 112000012012002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200210210000211 - 217 = 200210209869139 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200210210000291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1962845196030 + ... + 1962845196131.
It is an arithmetic number, because the mean of its divisors is an integer number (35331213529458).
Almost surely, 2200210210000211 is an apocalyptic number.
200210210000211 is a deficient number, since it is larger than the sum of its proper divisors (82439498235453).
200210210000211 is a wasteful number, since it uses less digits than its factorization.
200210210000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3925690392181.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200210210000211 its reverse (112000012012002), we get a palindrome (312210222012213).
The spelling of 200210210000211 in words is "two hundred trillion, two hundred ten billion, two hundred ten million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •