Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0100011011110111110001 |
3 | 1102221200210100101110020002 |
4 | 2200011211110123313301 |
5 | 2420220233420212123 |
6 | 35221501330155345 |
7 | 2213542534322513 |
oct | 240054524336761 |
9 | 42850710343202 |
10 | 11001111100913 |
11 | 35615aa46652a |
12 | 1298109a22b55 |
13 | 61a52869070b |
14 | 2a0656d63bb3 |
15 | 14126ded4528 |
hex | a016551bdf1 |
11001111100913 has 2 divisors, whose sum is σ = 11001111100914. Its totient is φ = 11001111100912.
The previous prime is 11001111100867. The next prime is 11001111101017. The reversal of 11001111100913 is 31900111110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8596201797184 + 2404909303729 = 2931928^2 + 1550777^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001111100913 - 214 = 11001111084529 is a prime.
It is not a weakly prime, because it can be changed into another prime (11001111100013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500555550456 + 5500555550457.
It is an arithmetic number, because the mean of its divisors is an integer number (5500555550457).
Almost surely, 211001111100913 is an apocalyptic number.
It is an amenable number.
11001111100913 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001111100913 is an equidigital number, since it uses as much as digits as its factorization.
11001111100913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
Adding to 11001111100913 its reverse (31900111110011), we get a palindrome (42901222210924).
The spelling of 11001111100913 in words is "eleven trillion, one billion, one hundred eleven million, one hundred thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •