Base | Representation |
---|---|
bin | 101111100011001011… |
… | …0101111111100010001 |
3 | 100202120100221010220211 |
4 | 1133012112233330101 |
5 | 3133111144200423 |
6 | 114524252404121 |
7 | 10243301346532 |
oct | 1370626577421 |
9 | 322510833824 |
10 | 102112100113 |
11 | 3a33a689191 |
12 | 17959176641 |
13 | 982427601a |
14 | 4d2977a689 |
15 | 29c989210d |
hex | 17c65aff11 |
102112100113 has 2 divisors, whose sum is σ = 102112100114. Its totient is φ = 102112100112.
The previous prime is 102112100087. The next prime is 102112100119. The reversal of 102112100113 is 311001211201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56134877184 + 45977222929 = 236928^2 + 214423^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102112100113 is a prime.
It is a super-2 number, since 2×1021121001132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102112100093 and 102112100102.
It is not a weakly prime, because it can be changed into another prime (102112100119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51056050056 + 51056050057.
It is an arithmetic number, because the mean of its divisors is an integer number (51056050057).
Almost surely, 2102112100113 is an apocalyptic number.
It is an amenable number.
102112100113 is a deficient number, since it is larger than the sum of its proper divisors (1).
102112100113 is an equidigital number, since it uses as much as digits as its factorization.
102112100113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 102112100113 its reverse (311001211201), we get a palindrome (413113311314).
The spelling of 102112100113 in words is "one hundred two billion, one hundred twelve million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •