Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1001101001111011100101 |
3 | 1110101001122220212002220012 |
4 | 2201310103221221323211 |
5 | 2424142230001003401 |
6 | 35352242452220005 |
7 | 2225251652403554 |
oct | 241642351517345 |
9 | 43331586762805 |
10 | 11120000016101 |
11 | 35a7a69125139 |
12 | 12b716960a605 |
13 | 6287c4615842 |
14 | 2a62d48c3d9b |
15 | 1443cb6648bb |
hex | a1d13a69ee5 |
11120000016101 has 2 divisors, whose sum is σ = 11120000016102. Its totient is φ = 11120000016100.
The previous prime is 11120000016071. The next prime is 11120000016143. The reversal of 11120000016101 is 10161000002111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10723994112001 + 396005904100 = 3274751^2 + 629290^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120000016101 - 218 = 11119999753957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120000066101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560000008050 + 5560000008051.
It is an arithmetic number, because the mean of its divisors is an integer number (5560000008051).
Almost surely, 211120000016101 is an apocalyptic number.
It is an amenable number.
11120000016101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120000016101 is an equidigital number, since it uses as much as digits as its factorization.
11120000016101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11120000016101 its reverse (10161000002111), we get a palindrome (21281000018212).
The spelling of 11120000016101 in words is "eleven trillion, one hundred twenty billion, sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •