Base | Representation |
---|---|
bin | 10111001101110010000000… |
… | …000111111011010011110111 |
3 | 111101111212101202010122100001 |
4 | 113031302000013323103313 |
5 | 101340320111200401403 |
6 | 1001053021320532131 |
7 | 30335430343311232 |
oct | 2715620007732367 |
9 | 441455352118301 |
10 | 102102112122103 |
11 | 2a595298550715 |
12 | b5500a6921047 |
13 | 44c8259960332 |
14 | 1b2daa9046419 |
15 | bc0d9c145c1d |
hex | 5cdc801fb4f7 |
102102112122103 has 2 divisors, whose sum is σ = 102102112122104. Its totient is φ = 102102112122102.
The previous prime is 102102112122011. The next prime is 102102112122161. The reversal of 102102112122103 is 301221211201201.
It is a strong prime.
It is an emirp because it is prime and its reverse (301221211201201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102102112122103 - 221 = 102102110024951 is a prime.
It is a super-2 number, since 2×1021021121221032 (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 (102102112122173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51051056061051 + 51051056061052.
It is an arithmetic number, because the mean of its divisors is an integer number (51051056061052).
Almost surely, 2102102112122103 is an apocalyptic number.
102102112122103 is a deficient number, since it is larger than the sum of its proper divisors (1).
102102112122103 is an equidigital number, since it uses as much as digits as its factorization.
102102112122103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 102102112122103 its reverse (301221211201201), we get a palindrome (403323323323304).
The spelling of 102102112122103 in words is "one hundred two trillion, one hundred two billion, one hundred twelve million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •