Base | Representation |
---|---|
bin | 1010000111010100111101… |
… | …0100001001001101010001 |
3 | 1110101011020200101212101100 |
4 | 2201311033110021031101 |
5 | 2424201302224310001 |
6 | 35352530051055013 |
7 | 2225315525614251 |
oct | 241651724111521 |
9 | 43334220355340 |
10 | 11121001010001 |
11 | 35a8432167723 |
12 | 12b73a88a1469 |
13 | 628923b1021c |
14 | 2a638b80d961 |
15 | 144439490586 |
hex | a1d4f509351 |
11121001010001 has 24 divisors (see below), whose sum is σ = 16104878263656. Its totient is φ = 7394983257600.
The previous prime is 11121001009907. The next prime is 11121001010003. The reversal of 11121001010001 is 10001010012111.
It can be written as a sum of positive squares in 4 ways, for example, as 4447438121025 + 6673562888976 = 2108895^2 + 2583324^2 .
It is not a de Polignac number, because 11121001010001 - 213 = 11121001001809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11121001010003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 54079291 + ... + 54284543.
It is an arithmetic number, because the mean of its divisors is an integer number (671036594319).
Almost surely, 211121001010001 is an apocalyptic number.
It is an amenable number.
11121001010001 is a deficient number, since it is larger than the sum of its proper divisors (4983877253655).
11121001010001 is a wasteful number, since it uses less digits than its factorization.
11121001010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220673 (or 220670 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11121001010001 its reverse (10001010012111), we get a palindrome (21122011022112).
The spelling of 11121001010001 in words is "eleven trillion, one hundred twenty-one billion, one million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •