Base | Representation |
---|---|
bin | 1011101101100111010… |
… | …1101010101110101001 |
3 | 201020101120222201001221 |
4 | 2323121311222232221 |
5 | 11244101121021022 |
6 | 232235103542041 |
7 | 20352333102322 |
oct | 2733165525651 |
9 | 636346881057 |
10 | 201223220137 |
11 | 7837a297635 |
12 | 32bb92ba921 |
13 | 15c8a883684 |
14 | 9a4c737449 |
15 | 537aa49cc7 |
hex | 2ed9d6aba9 |
201223220137 has 2 divisors, whose sum is σ = 201223220138. Its totient is φ = 201223220136.
The previous prime is 201223220113. The next prime is 201223220147. The reversal of 201223220137 is 731022322102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 159273626281 + 41949593856 = 399091^2 + 204816^2 .
It is a cyclic number.
It is not a de Polignac number, because 201223220137 - 227 = 201089002409 is a prime.
It is a super-3 number, since 3×2012232201373 (a number of 35 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (201223220147) 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, 100611610068 + 100611610069.
It is an arithmetic number, because the mean of its divisors is an integer number (100611610069).
Almost surely, 2201223220137 is an apocalyptic number.
It is an amenable number.
201223220137 is a deficient number, since it is larger than the sum of its proper divisors (1).
201223220137 is an equidigital number, since it uses as much as digits as its factorization.
201223220137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 25.
Adding to 201223220137 its reverse (731022322102), we get a palindrome (932245542239).
The spelling of 201223220137 in words is "two hundred one billion, two hundred twenty-three million, two hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •