Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0101010100011101100001 |
3 | 1110022100012112202111200012 |
4 | 2201203202311110131201 |
5 | 2423343344241333441 |
6 | 35340104445334305 |
7 | 2224043636333231 |
oct | 241434265243541 |
9 | 43270175674605 |
10 | 11102001121121 |
11 | 35a0372227a19 |
12 | 12b3785867395 |
13 | 626bb66b1221 |
14 | 2a54a82a3cc1 |
15 | 143bc64289eb |
hex | a18e2d54761 |
11102001121121 has 2 divisors, whose sum is σ = 11102001121122. Its totient is φ = 11102001121120.
The previous prime is 11102001121097. The next prime is 11102001121163. The reversal of 11102001121121 is 12112110020111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10432648061521 + 669353059600 = 3229961^2 + 818140^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102001121121 - 214 = 11102001104737 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11102001121096 and 11102001121105.
It is not a weakly prime, because it can be changed into another prime (11102001121171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551000560560 + 5551000560561.
It is an arithmetic number, because the mean of its divisors is an integer number (5551000560561).
Almost surely, 211102001121121 is an apocalyptic number.
It is an amenable number.
11102001121121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102001121121 is an equidigital number, since it uses as much as digits as its factorization.
11102001121121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11102001121121 its reverse (12112110020111), we get a palindrome (23214111141232).
The spelling of 11102001121121 in words is "eleven trillion, one hundred two billion, one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •