Base | Representation |
---|---|
bin | 1100001010010… |
… | …01000011101001 |
3 | 21002221200221101 |
4 | 12011021003221 |
5 | 202103323423 |
6 | 14042241401 |
7 | 2346036331 |
oct | 605110351 |
9 | 232850841 |
10 | 102011113 |
11 | 52645506 |
12 | 2a1b6261 |
13 | 18199009 |
14 | d7960c1 |
15 | 8e507ad |
hex | 61490e9 |
102011113 has 2 divisors, whose sum is σ = 102011114. Its totient is φ = 102011112.
The previous prime is 102011087. The next prime is 102011191. The reversal of 102011113 is 311110201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57881664 + 44129449 = 7608^2 + 6643^2 .
It is an emirp because it is prime and its reverse (311110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011113 - 225 = 68456681 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102011113.
It is not a weakly prime, because it can be changed into another prime (102021113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005556 + 51005557.
It is an arithmetic number, because the mean of its divisors is an integer number (51005557).
Almost surely, 2102011113 is an apocalyptic number.
It is an amenable number.
102011113 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011113 is an equidigital number, since it uses as much as digits as its factorization.
102011113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 102011113 is about 10100.0550988596. The cubic root of 102011113 is about 467.2498407125.
Adding to 102011113 its reverse (311110201), we get a palindrome (413121314).
The spelling of 102011113 in words is "one hundred two million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •