Base | Representation |
---|---|
bin | 10111001111001111001101… |
… | …111101010110010111101011 |
3 | 111101212102202012022102200022 |
4 | 113033033031331112113223 |
5 | 101343440102232020021 |
6 | 1001211013223031055 |
7 | 30345602563150655 |
oct | 2717171575262753 |
9 | 441772665272608 |
10 | 102202202220011 |
11 | 2a62378a8246a3 |
12 | b56757a89b48b |
13 | 450481b02743a |
14 | 1b3488203b6d5 |
15 | bc37a922b1ab |
hex | 5cf3cdf565eb |
102202202220011 has 2 divisors, whose sum is σ = 102202202220012. Its totient is φ = 102202202220010.
The previous prime is 102202202219933. The next prime is 102202202220037. The reversal of 102202202220011 is 110022202202201.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (110022202202201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102202202220011 - 242 = 97804155708907 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (102202202220211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51101101110005 + 51101101110006.
It is an arithmetic number, because the mean of its divisors is an integer number (51101101110006).
Almost surely, 2102202202220011 is an apocalyptic number.
102202202220011 is a deficient number, since it is larger than the sum of its proper divisors (1).
102202202220011 is an equidigital number, since it uses as much as digits as its factorization.
102202202220011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 102202202220011 its reverse (110022202202201), we get a palindrome (212224404422212).
The spelling of 102202202220011 in words is "one hundred two trillion, two hundred two billion, two hundred two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •