Base | Representation |
---|---|
bin | 10111001111001111001110… |
… | …011011000100011110101001 |
3 | 111101212102202201222020222021 |
4 | 113033033032123010132221 |
5 | 101343440111230323144 |
6 | 1001211014102024441 |
7 | 30345603016320241 |
oct | 2717171633043651 |
9 | 441772681866867 |
10 | 102202210011049 |
11 | 2a623794166175 |
12 | b567581418121 |
13 | 450481c824715 |
14 | 1b348830a8b21 |
15 | bc37a9c69884 |
hex | 5cf3ce6c47a9 |
102202210011049 has 2 divisors, whose sum is σ = 102202210011050. Its totient is φ = 102202210011048.
The previous prime is 102202210010981. The next prime is 102202210011101. The reversal of 102202210011049 is 940110012202201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100843912999449 + 1358297011600 = 10042107^2 + 1165460^2 .
It is an emirp because it is prime and its reverse (940110012202201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102202210011049 - 229 = 102201673140137 is a prime.
It is a super-2 number, since 2×1022022100110492 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102202210011149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51101105005524 + 51101105005525.
It is an arithmetic number, because the mean of its divisors is an integer number (51101105005525).
Almost surely, 2102202210011049 is an apocalyptic number.
It is an amenable number.
102202210011049 is a deficient number, since it is larger than the sum of its proper divisors (1).
102202210011049 is an equidigital number, since it uses as much as digits as its factorization.
102202210011049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 102202210011049 in words is "one hundred two trillion, two hundred two billion, two hundred ten million, eleven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •