Base | Representation |
---|---|
bin | 1010000110110101111010… |
… | …0010100100101010001001 |
3 | 1110100100201211120201010020 |
4 | 2201231132202210222021 |
5 | 2424032220112003410 |
6 | 35345031042011053 |
7 | 2224602143601240 |
oct | 241553642445211 |
9 | 43310654521106 |
10 | 11112666516105 |
11 | 35a49455a6040 |
12 | 12b5861646a89 |
13 | 627bc61b2a2b |
14 | 2a5bda953957 |
15 | 1440ec920a70 |
hex | a1b5e8a4a89 |
11112666516105 has 64 divisors (see below), whose sum is σ = 22282463397888. Its totient is φ = 4594322165760.
The previous prime is 11112666516079. The next prime is 11112666516109. The reversal of 11112666516105 is 50161566621111.
It is not a de Polignac number, because 11112666516105 - 28 = 11112666515849 is a prime.
It is a super-2 number, since 2×111126665161052 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11112666516109) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 24702879 + ... + 25148708.
It is an arithmetic number, because the mean of its divisors is an integer number (348163490592).
Almost surely, 211112666516105 is an apocalyptic number.
11112666516105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11112666516105 is an abundant number, since it is smaller than the sum of its proper divisors (11169796881783).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112666516105 is a wasteful number, since it uses less digits than its factorization.
11112666516105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49851806.
The product of its (nonzero) digits is 64800, while the sum is 42.
The spelling of 11112666516105 in words is "eleven trillion, one hundred twelve billion, six hundred sixty-six million, five hundred sixteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •