Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …1110011100110000101101 |
3 | 1110022011001212102001112011 |
4 | 2201201230032130300231 |
5 | 2423330310333020023 |
6 | 35335135203041221 |
7 | 2223643424422252 |
oct | 241415416346055 |
9 | 43264055361464 |
10 | 11100011220013 |
11 | 359a540a58851 |
12 | 12b330b370211 |
13 | 62695a361751 |
14 | 2a5359cb7429 |
15 | 143b0b8ad50d |
hex | a186c39cc2d |
11100011220013 has 2 divisors, whose sum is σ = 11100011220014. Its totient is φ = 11100011220012.
The previous prime is 11100011219993. The next prime is 11100011220043. The reversal of 11100011220013 is 31002211000111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6873216509124 + 4226794710889 = 2621682^2 + 2055917^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100011220013 - 233 = 11091421285421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100011219975 and 11100011220002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100011220043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550005610006 + 5550005610007.
It is an arithmetic number, because the mean of its divisors is an integer number (5550005610007).
Almost surely, 211100011220013 is an apocalyptic number.
It is an amenable number.
11100011220013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100011220013 is an equidigital number, since it uses as much as digits as its factorization.
11100011220013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11100011220013 its reverse (31002211000111), we get a palindrome (42102222220124).
The spelling of 11100011220013 in words is "eleven trillion, one hundred billion, eleven million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •