Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0100110000110000001001 |
3 | 1110022020122112220012020011 |
4 | 2201202213310300300021 |
5 | 2423334332321302423 |
6 | 35335422322231521 |
7 | 2224010255423056 |
oct | 241424764606011 |
9 | 43266575805204 |
10 | 11101011119113 |
11 | 359aa04412843 |
12 | 12b354a1b55a1 |
13 | 626a89564a16 |
14 | 2a54129da02d |
15 | 143b6956eb0d |
hex | a18a7d30c09 |
11101011119113 has 2 divisors, whose sum is σ = 11101011119114. Its totient is φ = 11101011119112.
The previous prime is 11101011119101. The next prime is 11101011119161. The reversal of 11101011119113 is 31191111010111.
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., 7804854676089 + 3296156443024 = 2793717^2 + 1815532^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101011119113 - 29 = 11101011118601 is a prime.
It is not a weakly prime, because it can be changed into another prime (11101011114113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550505559556 + 5550505559557.
It is an arithmetic number, because the mean of its divisors is an integer number (5550505559557).
Almost surely, 211101011119113 is an apocalyptic number.
It is an amenable number.
11101011119113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101011119113 is an equidigital number, since it uses as much as digits as its factorization.
11101011119113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 22.
Adding to 11101011119113 its reverse (31191111010111), we get a palindrome (42292122129224).
The spelling of 11101011119113 in words is "eleven trillion, one hundred one billion, eleven million, one hundred nineteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •