Base | Representation |
---|---|
bin | 10111001111011111110011… |
… | …111110110101010001101001 |
3 | 111101221010201221122001111012 |
4 | 113033133303332311101221 |
5 | 101344233100110342022 |
6 | 1001223121240113305 |
7 | 30350103246660536 |
oct | 2717376376652151 |
9 | 441833657561435 |
10 | 102220020012137 |
11 | 2a6302a3476635 |
12 | b56ab11a65835 |
13 | 45063ca58cbc1 |
14 | 1b35692597d8d |
15 | bc3e9d5e1de2 |
hex | 5cf7f3fb5469 |
102220020012137 has 2 divisors, whose sum is σ = 102220020012138. Its totient is φ = 102220020012136.
The previous prime is 102220020012029. The next prime is 102220020012167. The reversal of 102220020012137 is 731210020022201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81768904123456 + 20451115888681 = 9042616^2 + 4522291^2 .
It is a cyclic number.
It is not a de Polignac number, because 102220020012137 - 28 = 102220020011881 is a prime.
It is not a weakly prime, because it can be changed into another prime (102220020012167) 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, 51110010006068 + 51110010006069.
It is an arithmetic number, because the mean of its divisors is an integer number (51110010006069).
Almost surely, 2102220020012137 is an apocalyptic number.
It is an amenable number.
102220020012137 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220020012137 is an equidigital number, since it uses as much as digits as its factorization.
102220020012137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 102220020012137 its reverse (731210020022201), we get a palindrome (833430040034338).
The spelling of 102220020012137 in words is "one hundred two trillion, two hundred twenty billion, twenty million, twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •