Base | Representation |
---|---|
bin | 10111001110101000011001… |
… | …101000010111100010000111 |
3 | 111101201110011102211201122222 |
4 | 113032220121220113202013 |
5 | 101342244222130141312 |
6 | 1001135521305442555 |
7 | 30342565655126303 |
oct | 2716503150274207 |
9 | 441643142751588 |
10 | 102160522115207 |
11 | 2a608041461a96 |
12 | b55b4881a045b |
13 | 4500907b7312a |
14 | 1b3284a686d03 |
15 | bc2669ec0672 |
hex | 5cea19a17887 |
102160522115207 has 2 divisors, whose sum is σ = 102160522115208. Its totient is φ = 102160522115206.
The previous prime is 102160522115131. The next prime is 102160522115219. The reversal of 102160522115207 is 702511225061201.
It is a strong prime.
It is an emirp because it is prime and its reverse (702511225061201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102160522115207 - 28 = 102160522114951 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102160522115287) 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, 51080261057603 + 51080261057604.
It is an arithmetic number, because the mean of its divisors is an integer number (51080261057604).
Almost surely, 2102160522115207 is an apocalyptic number.
102160522115207 is a deficient number, since it is larger than the sum of its proper divisors (1).
102160522115207 is an equidigital number, since it uses as much as digits as its factorization.
102160522115207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16800, while the sum is 35.
Adding to 102160522115207 its reverse (702511225061201), we get a palindrome (804671747176408).
The spelling of 102160522115207 in words is "one hundred two trillion, one hundred sixty billion, five hundred twenty-two million, one hundred fifteen thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •