Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …1000101011010001111111 |
3 | 1110022100012121102012200011 |
4 | 2201203202320223101333 |
5 | 2423343400003013043 |
6 | 35340104520244051 |
7 | 2224043646656443 |
oct | 241434270532177 |
9 | 43270177365604 |
10 | 11102002001023 |
11 | 35a037277900a |
12 | 12b3786010627 |
13 | 626bb692b88b |
14 | 2a54a8452823 |
15 | 143bc654e59d |
hex | a18e2e2b47f |
11102002001023 has 2 divisors, whose sum is σ = 11102002001024. Its totient is φ = 11102002001022.
The previous prime is 11102002000981. The next prime is 11102002001053. The reversal of 11102002001023 is 32010020020111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11102002001023 - 213 = 11102001992831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102002000994 and 11102002001012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102002001053) 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, 5551001000511 + 5551001000512.
It is an arithmetic number, because the mean of its divisors is an integer number (5551001000512).
Almost surely, 211102002001023 is an apocalyptic number.
11102002001023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102002001023 is an equidigital number, since it uses as much as digits as its factorization.
11102002001023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11102002001023 its reverse (32010020020111), we get a palindrome (43112022021134).
The spelling of 11102002001023 in words is "eleven trillion, one hundred two billion, two million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •