Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …1011010111011001100011 |
3 | 1102221210002102222101222112 |
4 | 2200012122123113121203 |
5 | 2420224100020010201 |
6 | 35222125555425535 |
7 | 2213603603634011 |
oct | 240063233273143 |
9 | 42853072871875 |
10 | 11002002110051 |
11 | 3561a17407917 |
12 | 12983182b52ab |
13 | 61a63b159964 |
14 | 2a06dd41d8b1 |
15 | 1412c23370bb |
hex | a019a6d7663 |
11002002110051 has 2 divisors, whose sum is σ = 11002002110052. Its totient is φ = 11002002110050.
The previous prime is 11002002110009. The next prime is 11002002110083. The reversal of 11002002110051 is 15001120020011.
It is a strong prime.
It is an emirp because it is prime and its reverse (15001120020011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11002002110051 - 222 = 11001997915747 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11002002110551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501001055025 + 5501001055026.
It is an arithmetic number, because the mean of its divisors is an integer number (5501001055026).
Almost surely, 211002002110051 is an apocalyptic number.
11002002110051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002002110051 is an equidigital number, since it uses as much as digits as its factorization.
11002002110051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 11002002110051 its reverse (15001120020011), we get a palindrome (26003122130062).
The spelling of 11002002110051 in words is "eleven trillion, two billion, two million, one hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •