Base | Representation |
---|---|
bin | 10111001101110010000000… |
… | …000011101110101110110001 |
3 | 111101111212101200001202021112 |
4 | 113031302000003232232301 |
5 | 101340320110410201001 |
6 | 1001053021241203105 |
7 | 30335430331050026 |
oct | 2715620003565661 |
9 | 441455350052245 |
10 | 102102111022001 |
11 | 2a59529796a142 |
12 | b5500a6490495 |
13 | 44c825966669c |
14 | 1b2daa8c3b54d |
15 | bc0d9bec9cbb |
hex | 5cdc800eebb1 |
102102111022001 has 2 divisors, whose sum is σ = 102102111022002. Its totient is φ = 102102111022000.
The previous prime is 102102111021919. The next prime is 102102111022013. The reversal of 102102111022001 is 100220111201201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53424419258401 + 48677691763600 = 7309201^2 + 6976940^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102102111022001 is a prime.
It is not a weakly prime, because it can be changed into another prime (102102111022501) 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, 51051055511000 + 51051055511001.
It is an arithmetic number, because the mean of its divisors is an integer number (51051055511001).
Almost surely, 2102102111022001 is an apocalyptic number.
It is an amenable number.
102102111022001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102102111022001 is an equidigital number, since it uses as much as digits as its factorization.
102102111022001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102102111022001 its reverse (100220111201201), we get a palindrome (202322222223202).
The spelling of 102102111022001 in words is "one hundred two trillion, one hundred two billion, one hundred eleven million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •