Base | Representation |
---|---|
bin | 1010000110001010110100… |
… | …1000001100111100100011 |
3 | 1110022020212202022221222211 |
4 | 2201202231020030330203 |
5 | 2423340023111221121 |
6 | 35335435221342551 |
7 | 2224012415646505 |
oct | 241425510147443 |
9 | 43266782287884 |
10 | 11101100101411 |
11 | 359aa4a669531 |
12 | 12b3573b67a57 |
13 | 626aa1b1b678 |
14 | 2a542075dd75 |
15 | 143b72299ce1 |
hex | a18ad20cf23 |
11101100101411 has 2 divisors, whose sum is σ = 11101100101412. Its totient is φ = 11101100101410.
The previous prime is 11101100101397. The next prime is 11101100101433. The reversal of 11101100101411 is 11410100110111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11101100101411 - 27 = 11101100101283 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101100101391 and 11101100101400.
It is not a weakly prime, because it can be changed into another prime (11101100101451) 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, 5550550050705 + 5550550050706.
It is an arithmetic number, because the mean of its divisors is an integer number (5550550050706).
Almost surely, 211101100101411 is an apocalyptic number.
11101100101411 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101100101411 is an equidigital number, since it uses as much as digits as its factorization.
11101100101411 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 11101100101411 its reverse (11410100110111), we get a palindrome (22511200211522).
The spelling of 11101100101411 in words is "eleven trillion, one hundred one billion, one hundred million, one hundred one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •