Base | Representation |
---|---|
bin | 10111001111011111110011… |
… | …100001000100011110000001 |
3 | 111101221010201101221200000222 |
4 | 113033133303201010132001 |
5 | 101344233041111210144 |
6 | 1001223120400552425 |
7 | 30350103123444116 |
oct | 2717376341043601 |
9 | 441833641850028 |
10 | 102220012210049 |
11 | 2a63029a027828 |
12 | b56ab0b322715 |
13 | 45063c8a8a896 |
14 | 1b3569152690d |
15 | bc3e9caa02ee |
hex | 5cf7f3844781 |
102220012210049 has 2 divisors, whose sum is σ = 102220012210050. Its totient is φ = 102220012210048.
The previous prime is 102220012210031. The next prime is 102220012210051. The reversal of 102220012210049 is 940012210022201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101696494843024 + 523517367025 = 10084468^2 + 723545^2 .
It is an emirp because it is prime and its reverse (940012210022201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102220012210049 is a prime.
Together with 102220012210051, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (102220012210079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110006105024 + 51110006105025.
It is an arithmetic number, because the mean of its divisors is an integer number (51110006105025).
Almost surely, 2102220012210049 is an apocalyptic number.
It is an amenable number.
102220012210049 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220012210049 is an equidigital number, since it uses as much as digits as its factorization.
102220012210049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 102220012210049 in words is "one hundred two trillion, two hundred twenty billion, twelve million, two hundred ten thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •