Base | Representation |
---|---|
bin | 1010000111011001001101… |
… | …1001010011110111111101 |
3 | 1110101021012021122220012221 |
4 | 2201312103121103313331 |
5 | 2424211122130340401 |
6 | 35353235252325341 |
7 | 2225356035321262 |
oct | 241662331236775 |
9 | 43337167586187 |
10 | 11122143215101 |
11 | 35a8968989286 |
12 | 12b7667313851 |
13 | 628a7664a329 |
14 | 2a64593b7269 |
15 | 1444a48b17a1 |
hex | a1d93653dfd |
11122143215101 has 16 divisors (see below), whose sum is σ = 11611383596208. Its totient is φ = 10642873651200.
The previous prime is 11122143215093. The next prime is 11122143215119. The reversal of 11122143215101 is 10151234122111.
It can be written as a sum of positive squares in 8 ways, for example, as 2661054863076 + 8461088352025 = 1631274^2 + 2908795^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122143215101 - 23 = 11122143215093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122143215191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18924411 + ... + 19503271.
It is an arithmetic number, because the mean of its divisors is an integer number (725711474763).
Almost surely, 211122143215101 is an apocalyptic number.
It is an amenable number.
11122143215101 is a deficient number, since it is larger than the sum of its proper divisors (489240381107).
11122143215101 is an equidigital number, since it uses as much as digits as its factorization.
11122143215101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 587472.
The product of its (nonzero) digits is 480, while the sum is 25.
Adding to 11122143215101 its reverse (10151234122111), we get a palindrome (21273377337212).
The spelling of 11122143215101 in words is "eleven trillion, one hundred twenty-two billion, one hundred forty-three million, two hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •