Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …1110001100011110011101 |
3 | 1110022020121211212112211111 |
4 | 2201202213032030132131 |
5 | 2423334322224242203 |
6 | 35335421321422021 |
7 | 2224010103454504 |
oct | 241424716143635 |
9 | 43266554775744 |
10 | 11101001009053 |
11 | 359a9a9737a1a |
12 | 12b354693a911 |
13 | 626a87435037 |
14 | 2a541152783b |
15 | 143b6872426d |
hex | a18a738c79d |
11101001009053 has 2 divisors, whose sum is σ = 11101001009054. Its totient is φ = 11101001009052.
The previous prime is 11101001009023. The next prime is 11101001009089. The reversal of 11101001009053 is 35090010010111.
11101001009053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9079536953529 + 2021464055524 = 3013227^2 + 1421782^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101001009053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101001009023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550500504526 + 5550500504527.
It is an arithmetic number, because the mean of its divisors is an integer number (5550500504527).
Almost surely, 211101001009053 is an apocalyptic number.
It is an amenable number.
11101001009053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101001009053 is an equidigital number, since it uses as much as digits as its factorization.
11101001009053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 135, while the sum is 22.
Adding to 11101001009053 its reverse (35090010010111), we get a palindrome (46191011019164).
The spelling of 11101001009053 in words is "eleven trillion, one hundred one billion, one million, nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •