Base | Representation |
---|---|
bin | 10111001101111001010111… |
… | …100001111100101011010111 |
3 | 111101112121210221002212220212 |
4 | 113031321113201330223113 |
5 | 101340432310334342213 |
6 | 1001100410203520035 |
7 | 30336130336623632 |
oct | 2715712741745327 |
9 | 441477727085825 |
10 | 102110021012183 |
11 | 2a598686949908 |
12 | b55173352901b |
13 | 44c8c1a353252 |
14 | 1b30219594c19 |
15 | bc11b16459a8 |
hex | 5cde5787cad7 |
102110021012183 has 2 divisors, whose sum is σ = 102110021012184. Its totient is φ = 102110021012182.
The previous prime is 102110021012099. The next prime is 102110021012243. The reversal of 102110021012183 is 381210120011201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102110021012183 - 214 = 102110020995799 is a prime.
It is a super-2 number, since 2×1021100210121832 (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 (102110021012383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055010506091 + 51055010506092.
It is an arithmetic number, because the mean of its divisors is an integer number (51055010506092).
Almost surely, 2102110021012183 is an apocalyptic number.
102110021012183 is a deficient number, since it is larger than the sum of its proper divisors (1).
102110021012183 is an equidigital number, since it uses as much as digits as its factorization.
102110021012183 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 102110021012183 its reverse (381210120011201), we get a palindrome (483320141023384).
The spelling of 102110021012183 in words is "one hundred two trillion, one hundred ten billion, twenty-one million, twelve thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.924 sec. • engine limits •