Base | Representation |
---|---|
bin | 101101011111110110110010… |
… | …001001001010100001110011 |
3 | 222020111111020002002220122211 |
4 | 231133312302021022201303 |
5 | 202211424244321201321 |
6 | 1545325121555312551 |
7 | 60101556526055503 |
oct | 5537666211124163 |
9 | 866444202086584 |
10 | 200101220100211 |
11 | 588384a6133831 |
12 | 1a538b598ab757 |
13 | 87866057ac9c1 |
14 | 375ad44b27a03 |
15 | 182015a4850e1 |
hex | b5fdb224a873 |
200101220100211 has 4 divisors (see below), whose sum is σ = 210632863263400. Its totient is φ = 189569576937024.
The previous prime is 200101220100161. The next prime is 200101220100233. The reversal of 200101220100211 is 112001022101002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200101220100211 - 27 = 200101220100083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200101220100191 and 200101220100200.
It is not an unprimeable number, because it can be changed into a prime (200101220100241) 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, 5265821581566 + ... + 5265821581603.
It is an arithmetic number, because the mean of its divisors is an integer number (52658215815850).
Almost surely, 2200101220100211 is an apocalyptic number.
200101220100211 is a deficient number, since it is larger than the sum of its proper divisors (10531643163189).
200101220100211 is a wasteful number, since it uses less digits than its factorization.
200101220100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10531643163188.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200101220100211 its reverse (112001022101002), we get a palindrome (312102242201213).
The spelling of 200101220100211 in words is "two hundred trillion, one hundred one billion, two hundred twenty million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •