Base | Representation |
---|---|
bin | 101101011111110110110001… |
… | …100011011100001100101101 |
3 | 222020111111012101111111101002 |
4 | 231133312301203130030231 |
5 | 202211424234303223432 |
6 | 1545325121003330045 |
7 | 60101556346030355 |
oct | 5537666143341455 |
9 | 866444171444332 |
10 | 200101210211117 |
11 | 588384a0599a26 |
12 | 1a538b56520925 |
13 | 8786603729777 |
14 | 375ad436b1b65 |
15 | 182015967ee62 |
hex | b5fdb18dc32d |
200101210211117 has 2 divisors, whose sum is σ = 200101210211118. Its totient is φ = 200101210211116.
The previous prime is 200101210211113. The next prime is 200101210211153. The reversal of 200101210211117 is 711112012101002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 154004972695876 + 46096237515241 = 12409874^2 + 6789421^2 .
It is a cyclic number.
It is not a de Polignac number, because 200101210211117 - 22 = 200101210211113 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200101210211113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050605105558 + 100050605105559.
It is an arithmetic number, because the mean of its divisors is an integer number (100050605105559).
Almost surely, 2200101210211117 is an apocalyptic number.
It is an amenable number.
200101210211117 is a deficient number, since it is larger than the sum of its proper divisors (1).
200101210211117 is an equidigital number, since it uses as much as digits as its factorization.
200101210211117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 200101210211117 its reverse (711112012101002), we get a palindrome (911213222312119).
The spelling of 200101210211117 in words is "two hundred trillion, one hundred one billion, two hundred ten million, two hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •