Base | Representation |
---|---|
bin | 1010000001101000010010… |
… | …0100000000011101100001 |
3 | 1110000210120111102001201000 |
4 | 2200122010210000131201 |
5 | 2421100312142104441 |
6 | 35235540305302213 |
7 | 2215251641665401 |
oct | 240320444003541 |
9 | 43023514361630 |
10 | 11023110113121 |
11 | 356a969317a57 |
12 | 12a0429334969 |
13 | 61c623257bc2 |
14 | 2a1742928801 |
15 | 141b0a4ba2b6 |
hex | a0684900761 |
11023110113121 has 32 divisors (see below), whose sum is σ = 16472518963200. Its totient is φ = 7284940830720.
The previous prime is 11023110113087. The next prime is 11023110113123. The reversal of 11023110113121 is 12131101132011.
11023110113121 is a `hidden beast` number, since 110 + 231 + 1 + 0 + 11 + 312 + 1 = 666.
It is not a de Polignac number, because 11023110113121 - 210 = 11023110112097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11023110113094 and 11023110113103.
It is not an unprimeable number, because it can be changed into a prime (11023110113123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2906401 + ... + 5522081.
It is an arithmetic number, because the mean of its divisors is an integer number (514766217600).
Almost surely, 211023110113121 is an apocalyptic number.
It is an amenable number.
11023110113121 is a deficient number, since it is larger than the sum of its proper divisors (5449408850079).
11023110113121 is a wasteful number, since it uses less digits than its factorization.
11023110113121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2617046 (or 2617040 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 11023110113121 its reverse (12131101132011), we get a palindrome (23154211245132).
The spelling of 11023110113121 in words is "eleven trillion, twenty-three billion, one hundred ten million, one hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •