Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0100011011101010010011 |
3 | 1102221200210100101102001011 |
4 | 2200011211110123222103 |
5 | 2420220233420200201 |
6 | 35221501330151351 |
7 | 2213542534320142 |
oct | 240054524335223 |
9 | 42850710342034 |
10 | 11001111100051 |
11 | 35615aa465916 |
12 | 1298109a22557 |
13 | 61a5286901c7 |
14 | 2a0656d63759 |
15 | 14126ded4151 |
hex | a016551ba93 |
11001111100051 has 2 divisors, whose sum is σ = 11001111100052. Its totient is φ = 11001111100050.
The previous prime is 11001111100037. The next prime is 11001111100081. The reversal of 11001111100051 is 15000111110011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11001111100051 - 217 = 11001110968979 is a prime.
It is a super-3 number, since 3×110011111000513 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (11001111100081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500555550025 + 5500555550026.
It is an arithmetic number, because the mean of its divisors is an integer number (5500555550026).
Almost surely, 211001111100051 is an apocalyptic number.
11001111100051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001111100051 is an equidigital number, since it uses as much as digits as its factorization.
11001111100051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 11001111100051 its reverse (15000111110011), we get a palindrome (26001222210062).
The spelling of 11001111100051 in words is "eleven trillion, one billion, one hundred eleven million, one hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •