Base | Representation |
---|---|
bin | 1010000110110011100011… |
… | …0110000110111101010001 |
3 | 1110100022002202120210121010 |
4 | 2201230320312012331101 |
5 | 2424024421212244441 |
6 | 35344444211121133 |
7 | 2224550364303510 |
oct | 241547066067521 |
9 | 43308082523533 |
10 | 11112034103121 |
11 | 35a4650619886 |
12 | 12b57058a31a9 |
13 | 627b25178a73 |
14 | 2a5b7a970677 |
15 | 1440b214e116 |
hex | a1b38d86f51 |
11112034103121 has 32 divisors (see below), whose sum is σ = 18079727339520. Its totient is φ = 5932410511104.
The previous prime is 11112034103119. The next prime is 11112034103171. The reversal of 11112034103121 is 12130143021111.
It is a happy number.
11112034103121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11112034103121 - 21 = 11112034103119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (11112034103171) 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, 267494136 + ... + 267535673.
It is an arithmetic number, because the mean of its divisors is an integer number (564991479360).
Almost surely, 211112034103121 is an apocalyptic number.
It is an amenable number.
11112034103121 is a deficient number, since it is larger than the sum of its proper divisors (6967693236399).
11112034103121 is a wasteful number, since it uses less digits than its factorization.
11112034103121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535029885.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11112034103121 its reverse (12130143021111), we get a palindrome (23242177124232).
The spelling of 11112034103121 in words is "eleven trillion, one hundred twelve billion, thirty-four million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •