Base | Representation |
---|---|
bin | 1010000111010001100110… |
… | …0111011100011110100001 |
3 | 1110101001220220011220012022 |
4 | 2201310121213130132201 |
5 | 2424142431111200001 |
6 | 35352300425311225 |
7 | 2225254306165424 |
oct | 241643147343641 |
9 | 43331826156168 |
10 | 11120100100001 |
11 | 35a800a673702 |
12 | 12b7197035515 |
13 | 62880c288599 |
14 | 2a6303cd79bb |
15 | 1443d533411b |
hex | a1d199dc7a1 |
11120100100001 has 2 divisors, whose sum is σ = 11120100100002. Its totient is φ = 11120100100000.
The previous prime is 11120100099973. The next prime is 11120100100027. The reversal of 11120100100001 is 10000100102111.
It is a happy number.
11120100100001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6667679374225 + 4452420725776 = 2582185^2 + 2110076^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120100100001 is a prime.
It is not a weakly prime, because it can be changed into another prime (11120100100201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560050050000 + 5560050050001.
It is an arithmetic number, because the mean of its divisors is an integer number (5560050050001).
Almost surely, 211120100100001 is an apocalyptic number.
It is an amenable number.
11120100100001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120100100001 is an equidigital number, since it uses as much as digits as its factorization.
11120100100001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11120100100001 its reverse (10000100102111), we get a palindrome (21120200202112).
The spelling of 11120100100001 in words is "eleven trillion, one hundred twenty billion, one hundred million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •