Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0110011111101110111 |
3 | 100122222112200110101212 |
4 | 1132022220303331313 |
5 | 3124033202432411 |
6 | 114241022312035 |
7 | 10206414352463 |
oct | 1361250637567 |
9 | 318875613355 |
10 | 101110202231 |
11 | 39976089505 |
12 | 1771972861b |
13 | 96c482303c |
14 | 4c726974a3 |
15 | 296b93868b |
hex | 178aa33f77 |
101110202231 has 2 divisors, whose sum is σ = 101110202232. Its totient is φ = 101110202230.
The previous prime is 101110202209. The next prime is 101110202233. The reversal of 101110202231 is 132202011101.
It is a strong prime.
It is an emirp because it is prime and its reverse (132202011101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101110202231 is a prime.
It is a super-2 number, since 2×1011102022312 (a number of 23 digits) contains 22 as substring.
Together with 101110202233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101110202233) 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 as a sum of consecutive naturals, namely, 50555101115 + 50555101116.
It is an arithmetic number, because the mean of its divisors is an integer number (50555101116).
Almost surely, 2101110202231 is an apocalyptic number.
101110202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110202231 is an equidigital number, since it uses as much as digits as its factorization.
101110202231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 101110202231 its reverse (132202011101), we get a palindrome (233312213332).
The spelling of 101110202231 in words is "one hundred one billion, one hundred ten million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •