Base | Representation |
---|---|
bin | 101101011111110110100101… |
… | …101000000111101011111111 |
3 | 222020111110200102222100221012 |
4 | 231133312211220013223333 |
5 | 202211423332042024411 |
6 | 1545325045054425435 |
7 | 60101551366145645 |
oct | 5537664550075377 |
9 | 866443612870835 |
10 | 200101010111231 |
11 | 588383a8648a19 |
12 | 1a538abb50227b |
13 | 87865a1138b78 |
14 | 375ad24ca5195 |
15 | 1820146d0618b |
hex | b5fda5a07aff |
200101010111231 has 2 divisors, whose sum is σ = 200101010111232. Its totient is φ = 200101010111230.
The previous prime is 200101010111159. The next prime is 200101010111237. The reversal of 200101010111231 is 132111010101002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200101010111231 - 210 = 200101010110207 is a prime.
It is a super-2 number, since 2×2001010101112312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200101010111237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050505055615 + 100050505055616.
It is an arithmetic number, because the mean of its divisors is an integer number (100050505055616).
Almost surely, 2200101010111231 is an apocalyptic number.
200101010111231 is a deficient number, since it is larger than the sum of its proper divisors (1).
200101010111231 is an equidigital number, since it uses as much as digits as its factorization.
200101010111231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 200101010111231 its reverse (132111010101002), we get a palindrome (332212020212233).
The spelling of 200101010111231 in words is "two hundred trillion, one hundred one billion, ten million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •