Base | Representation |
---|---|
bin | 1011101100110010001… |
… | …0001100010111011111 |
3 | 201012211000222112000102 |
4 | 2323030202030113133 |
5 | 11243122000324411 |
6 | 232201011451315 |
7 | 20343652622435 |
oct | 2731442142737 |
9 | 635730875012 |
10 | 201000011231 |
11 | 782752a2468 |
12 | 32b565b6b3b |
13 | 15c535614b6 |
14 | 9a2ac32d55 |
15 | 5366158d3b |
hex | 2ecc88c5df |
201000011231 has 2 divisors, whose sum is σ = 201000011232. Its totient is φ = 201000011230.
The previous prime is 201000011213. The next prime is 201000011237. The reversal of 201000011231 is 132110000102.
Together with previous prime (201000011213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201000011231 - 222 = 200995816927 is a prime.
It is a super-2 number, since 2×2010000112312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201000011237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500005615 + 100500005616.
It is an arithmetic number, because the mean of its divisors is an integer number (100500005616).
Almost surely, 2201000011231 is an apocalyptic number.
201000011231 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000011231 is an equidigital number, since it uses as much as digits as its factorization.
201000011231 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 11.
Adding to 201000011231 its reverse (132110000102), we get a palindrome (333110011333).
The spelling of 201000011231 in words is "two hundred one billion, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •