Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1010100000111000110011 |
3 | 1102221200202120201010110111 |
4 | 2200011210222200320303 |
5 | 2420220223112031121 |
6 | 35221500254442151 |
7 | 2213542342032244 |
oct | 240054452407063 |
9 | 42850676633414 |
10 | 11001100111411 |
11 | 35615a423a9a3 |
12 | 1298106203357 |
13 | 61a526313657 |
14 | 2a0655702ccb |
15 | 14126d0632e1 |
hex | a0164aa0e33 |
11001100111411 has 2 divisors, whose sum is σ = 11001100111412. Its totient is φ = 11001100111410.
The previous prime is 11001100111367. The next prime is 11001100111423. The reversal of 11001100111411 is 11411100110011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11001100111411 - 225 = 11001066556979 is a prime.
It is a super-2 number, since 2×110011001114112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11001100111391 and 11001100111400.
It is not a weakly prime, because it can be changed into another prime (11001100111481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500550055705 + 5500550055706.
It is an arithmetic number, because the mean of its divisors is an integer number (5500550055706).
Almost surely, 211001100111411 is an apocalyptic number.
11001100111411 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001100111411 is an equidigital number, since it uses as much as digits as its factorization.
11001100111411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11001100111411 its reverse (11411100110011), we get a palindrome (22412200221422).
The spelling of 11001100111411 in words is "eleven trillion, one billion, one hundred million, one hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •