Base | Representation |
---|---|
bin | 10111001111001101010000… |
… | …101010000110011100100011 |
3 | 111101212020022200122201012121 |
4 | 113033031100222012130203 |
5 | 101343421301101201201 |
6 | 1001210024445405111 |
7 | 30345466515600643 |
oct | 2717152052063443 |
9 | 441766280581177 |
10 | 102200100022051 |
11 | 2a622901125209 |
12 | b567092869797 |
13 | 450457464a015 |
14 | 1b34722b7c523 |
15 | bc36d48cc9a1 |
hex | 5cf350a86723 |
102200100022051 has 2 divisors, whose sum is σ = 102200100022052. Its totient is φ = 102200100022050.
The previous prime is 102200100021979. The next prime is 102200100022067. The reversal of 102200100022051 is 150220001002201.
It is a happy number.
It is an a-pointer prime, because the next prime (102200100022067) can be obtained adding 102200100022051 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102200100022051 - 225 = 102200066467619 is a prime.
It is not a weakly prime, because it can be changed into another prime (102200100062051) 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, 51100050011025 + 51100050011026.
It is an arithmetic number, because the mean of its divisors is an integer number (51100050011026).
Almost surely, 2102200100022051 is an apocalyptic number.
102200100022051 is a deficient number, since it is larger than the sum of its proper divisors (1).
102200100022051 is an equidigital number, since it uses as much as digits as its factorization.
102200100022051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 102200100022051 its reverse (150220001002201), we get a palindrome (252420101024252).
The spelling of 102200100022051 in words is "one hundred two trillion, two hundred billion, one hundred million, twenty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •