Base | Representation |
---|---|
bin | 10111001101111011011010… |
… | …011011000000001011001101 |
3 | 111101112211110222020222012201 |
4 | 113031323122123000023031 |
5 | 101341001310023204142 |
6 | 1001101412131401501 |
7 | 30336235633361404 |
oct | 2715733233001315 |
9 | 441484428228181 |
10 | 102112217006797 |
11 | 2a599603493098 |
12 | b552046a53291 |
13 | 44c91aa2b174a |
14 | 1b303870ac63b |
15 | bc128e320ab7 |
hex | 5cdeda6c02cd |
102112217006797 has 2 divisors, whose sum is σ = 102112217006798. Its totient is φ = 102112217006796.
The previous prime is 102112217006717. The next prime is 102112217006803. The reversal of 102112217006797 is 797600712211201.
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., 98970145243876 + 3142071762921 = 9948374^2 + 1772589^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102112217006797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102112217006707) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51056108503398 + 51056108503399.
It is an arithmetic number, because the mean of its divisors is an integer number (51056108503399).
Almost surely, 2102112217006797 is an apocalyptic number.
It is an amenable number.
102112217006797 is a deficient number, since it is larger than the sum of its proper divisors (1).
102112217006797 is an equidigital number, since it uses as much as digits as its factorization.
102112217006797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 148176, while the sum is 46.
Adding to 102112217006797 its reverse (797600712211201), we get a palindrome (899712929217998).
The spelling of 102112217006797 in words is "one hundred two trillion, one hundred twelve billion, two hundred seventeen million, six thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •