Base | Representation |
---|---|
bin | 1010000000010101111010… |
… | …1101000000010100000001 |
3 | 1102221200111121112002010200 |
4 | 2200011132231000110001 |
5 | 2420220022011213441 |
6 | 35221442323115413 |
7 | 2213540015665122 |
oct | 240053655002401 |
9 | 42850447462120 |
10 | 11001000101121 |
11 | 3561552841768 |
12 | 1298098812b69 |
13 | 61a50b698274 |
14 | 2a064630c049 |
15 | 1412643aa7b6 |
hex | a015eb40501 |
11001000101121 has 12 divisors (see below), whose sum is σ = 15910997122020. Its totient is φ = 7324463001600.
The previous prime is 11001000101111. The next prime is 11001000101171. The reversal of 11001000101121 is 12110100010011.
It can be written as a sum of positive squares in 2 ways, for example, as 2947096657521 + 8053903443600 = 1716711^2 + 2837940^2 .
It is not a de Polignac number, because 11001000101121 - 215 = 11001000068353 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11001000101111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 794748180 + ... + 794762021.
It is an arithmetic number, because the mean of its divisors is an integer number (1325916426835).
Almost surely, 211001000101121 is an apocalyptic number.
It is an amenable number.
11001000101121 is a deficient number, since it is larger than the sum of its proper divisors (4909997020899).
11001000101121 is a wasteful number, since it uses less digits than its factorization.
11001000101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1589510976 (or 1589510973 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11001000101121 its reverse (12110100010011), we get a palindrome (23111100111132).
The spelling of 11001000101121 in words is "eleven trillion, one billion, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •