Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0100011100011010110001 |
3 | 1102221200210100101120022001 |
4 | 2200011211110130122301 |
5 | 2420220233420300103 |
6 | 35221501330214001 |
7 | 2213542534332163 |
oct | 240054524343261 |
9 | 42850710346261 |
10 | 11001111103153 |
11 | 35615aa468186 |
12 | 1298109a24301 |
13 | 61a528691742 |
14 | 2a0656d64933 |
15 | 14126ded501d |
hex | a016551c6b1 |
11001111103153 has 2 divisors, whose sum is σ = 11001111103154. Its totient is φ = 11001111103152.
The previous prime is 11001111103079. The next prime is 11001111103159. The reversal of 11001111103153 is 35130111110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10497418560784 + 503692542369 = 3239972^2 + 709713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001111103153 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11001111103153.
It is not a weakly prime, because it can be changed into another prime (11001111103159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500555551576 + 5500555551577.
It is an arithmetic number, because the mean of its divisors is an integer number (5500555551577).
Almost surely, 211001111103153 is an apocalyptic number.
It is an amenable number.
11001111103153 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001111103153 is an equidigital number, since it uses as much as digits as its factorization.
11001111103153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45, while the sum is 19.
Adding to 11001111103153 its reverse (35130111110011), we get a palindrome (46131222213164).
The spelling of 11001111103153 in words is "eleven trillion, one billion, one hundred eleven million, one hundred three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.256 sec. • engine limits •