Base | Representation |
---|---|
bin | 1010000110011001101111… |
… | …1001111010101010001000 |
3 | 1110022122012221100100012111 |
4 | 2201212123321322222020 |
5 | 2423421224131023422 |
6 | 35341340524152104 |
7 | 2224213611323206 |
oct | 241463371725210 |
9 | 43278187310174 |
10 | 11105106111112 |
11 | 35a1715987952 |
12 | 12b42b1698634 |
13 | 62728ca65600 |
14 | 2a56c07da076 |
15 | 143d08d0aa77 |
hex | a199be7aa88 |
11105106111112 has 24 divisors (see below), whose sum is σ = 22546979496090. Its totient is φ = 5125433589120.
The previous prime is 11105106111107. The next prime is 11105106111119. The reversal of 11105106111112 is 21111160150111.
11105106111112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 7812282142116 + 3292823968996 = 2795046^2 + 1814614^2 .
It is not an unprimeable number, because it can be changed into a prime (11105106111119) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4106916589 + ... + 4106919292.
Almost surely, 211105106111112 is an apocalyptic number.
It is an amenable number.
11105106111112 is an abundant number, since it is smaller than the sum of its proper divisors (11441873384978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11105106111112 is a wasteful number, since it uses less digits than its factorization.
11105106111112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8213835913 (or 8213835896 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 22.
Adding to 11105106111112 its reverse (21111160150111), we get a palindrome (32216266261223).
The spelling of 11105106111112 in words is "eleven trillion, one hundred five billion, one hundred six million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •