Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1101111111101001101001 |
3 | 1110000121200211220021001011 |
4 | 2200120103331333221221 |
5 | 2421032430100201022 |
6 | 35235025025223521 |
7 | 2215154063436043 |
oct | 240302375775151 |
9 | 43017624807034 |
10 | 11021221100137 |
11 | 356a089a965a6 |
12 | 129bba0791ba1 |
13 | 61c3b1aa0241 |
14 | 2a1603ac0a93 |
15 | 141a4972c977 |
hex | a0613f7fa69 |
11021221100137 has 2 divisors, whose sum is σ = 11021221100138. Its totient is φ = 11021221100136.
The previous prime is 11021221100081. The next prime is 11021221100159. The reversal of 11021221100137 is 73100112212011.
It is an a-pointer prime, because the next prime (11021221100159) can be obtained adding 11021221100137 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8384377745241 + 2636843354896 = 2895579^2 + 1623836^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021221100137 - 223 = 11021212711529 is a prime.
It is not a weakly prime, because it can be changed into another prime (11021221100177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510610550068 + 5510610550069.
It is an arithmetic number, because the mean of its divisors is an integer number (5510610550069).
Almost surely, 211021221100137 is an apocalyptic number.
It is an amenable number.
11021221100137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021221100137 is an equidigital number, since it uses as much as digits as its factorization.
11021221100137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 11021221100137 its reverse (73100112212011), we get a palindrome (84121333312148).
The spelling of 11021221100137 in words is "eleven trillion, twenty-one billion, two hundred twenty-one million, one hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •