Base | Representation |
---|---|
bin | 1010000001100100111110… |
… | …1001011000100100011001 |
3 | 1110000201021121220000101202 |
4 | 2200121033221120210121 |
5 | 2421042002404031022 |
6 | 35235312233123545 |
7 | 2215220641651664 |
oct | 240311751304431 |
9 | 43021247800352 |
10 | 11022222330137 |
11 | 356a55317a507 |
12 | 12a021bb595b5 |
13 | 61c51134b225 |
14 | 2a169aa6c6db |
15 | 141aa75a3592 |
hex | a064fa58919 |
11022222330137 has 2 divisors, whose sum is σ = 11022222330138. Its totient is φ = 11022222330136.
The previous prime is 11022222330121. The next prime is 11022222330187. The reversal of 11022222330137 is 73103322222011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6719651188441 + 4302571141696 = 2592229^2 + 2074264^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022222330137 - 24 = 11022222330121 is a prime.
It is not a weakly prime, because it can be changed into another prime (11022222330187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511111165068 + 5511111165069.
It is an arithmetic number, because the mean of its divisors is an integer number (5511111165069).
Almost surely, 211022222330137 is an apocalyptic number.
It is an amenable number.
11022222330137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022222330137 is an equidigital number, since it uses as much as digits as its factorization.
11022222330137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 11022222330137 its reverse (73103322222011), we get a palindrome (84125544552148).
The spelling of 11022222330137 in words is "eleven trillion, twenty-two billion, two hundred twenty-two million, three hundred thirty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •