Base | Representation |
---|---|
bin | 1100110111010011000… |
… | …0001001110010001001 |
3 | 210010110000110112011111 |
4 | 3031310300021302021 |
5 | 12110103020042022 |
6 | 245305454130321 |
7 | 21652431646432 |
oct | 3156460116211 |
9 | 703400415144 |
10 | 221002112137 |
11 | 857a9a26974 |
12 | 369b91b09a1 |
13 | 17ac04c3471 |
14 | a9a7504489 |
15 | 5b3718c477 |
hex | 3374c09c89 |
221002112137 has 2 divisors, whose sum is σ = 221002112138. Its totient is φ = 221002112136.
The previous prime is 221002112119. The next prime is 221002112159. The reversal of 221002112137 is 731211200122.
It is an a-pointer prime, because the next prime (221002112159) can be obtained adding 221002112137 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 217688498041 + 3313614096 = 466571^2 + 57564^2 .
It is a cyclic number.
It is not a de Polignac number, because 221002112137 - 227 = 220867894409 is a prime.
It is not a weakly prime, because it can be changed into another prime (221002118137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110501056068 + 110501056069.
It is an arithmetic number, because the mean of its divisors is an integer number (110501056069).
Almost surely, 2221002112137 is an apocalyptic number.
It is an amenable number.
221002112137 is a deficient number, since it is larger than the sum of its proper divisors (1).
221002112137 is an equidigital number, since it uses as much as digits as its factorization.
221002112137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 221002112137 its reverse (731211200122), we get a palindrome (952213312259).
The spelling of 221002112137 in words is "two hundred twenty-one billion, two million, one hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •