Base | Representation |
---|---|
bin | 1010000000111111010010… |
… | …1011111100011010110101 |
3 | 1102222202011121212110202011 |
4 | 2200033310223330122311 |
5 | 2420410243210340041 |
6 | 35230520344244221 |
7 | 2214412155316303 |
oct | 240176453743265 |
9 | 42882147773664 |
10 | 11012106340021 |
11 | 3566231a423a6 |
12 | 129a278170671 |
13 | 61b58b60c067 |
14 | 2a0dbb355273 |
15 | 1416b4432e81 |
hex | a03f4afc6b5 |
11012106340021 has 2 divisors, whose sum is σ = 11012106340022. Its totient is φ = 11012106340020.
The previous prime is 11012106340007. The next prime is 11012106340057. The reversal of 11012106340021 is 12004360121011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7834037134225 + 3178069205796 = 2798935^2 + 1782714^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012106340021 - 217 = 11012106208949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11012106339974 and 11012106340001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012106349021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506053170010 + 5506053170011.
It is an arithmetic number, because the mean of its divisors is an integer number (5506053170011).
Almost surely, 211012106340021 is an apocalyptic number.
It is an amenable number.
11012106340021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012106340021 is an equidigital number, since it uses as much as digits as its factorization.
11012106340021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11012106340021 its reverse (12004360121011), we get a palindrome (23016466461032).
The spelling of 11012106340021 in words is "eleven trillion, twelve billion, one hundred six million, three hundred forty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •