Base | Representation |
---|---|
bin | 10111001101110001001001… |
… | …110000100010011001101001 |
3 | 111101111210001011212002222022 |
4 | 113031301021300202121221 |
5 | 101340311224201133342 |
6 | 1001052351015234225 |
7 | 30335365626502514 |
oct | 2715611160423151 |
9 | 441453034762868 |
10 | 102101200021097 |
11 | 2a59496a703732 |
12 | b54ba91378975 |
13 | 44c81429ba9b4 |
14 | 1b2da1dc59d7b |
15 | bc0d470289d2 |
hex | 5cdc49c22669 |
102101200021097 has 2 divisors, whose sum is σ = 102101200021098. Its totient is φ = 102101200021096.
The previous prime is 102101200021087. The next prime is 102101200021189. The reversal of 102101200021097 is 790120002101201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102099323745241 + 1876275856 = 10104421^2 + 43316^2 .
It is an emirp because it is prime and its reverse (790120002101201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102101200021097 - 236 = 102032480544361 is a prime.
It is not a weakly prime, because it can be changed into another prime (102101200021087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050600010548 + 51050600010549.
It is an arithmetic number, because the mean of its divisors is an integer number (51050600010549).
Almost surely, 2102101200021097 is an apocalyptic number.
It is an amenable number.
102101200021097 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101200021097 is an equidigital number, since it uses as much as digits as its factorization.
102101200021097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 26.
Adding to 102101200021097 its reverse (790120002101201), we get a palindrome (892221202122298).
The spelling of 102101200021097 in words is "one hundred two trillion, one hundred one billion, two hundred million, twenty-one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •