Base | Representation |
---|---|
bin | 10100101011010010… |
… | …11101110111010101 |
3 | 1001122121202102012220 |
4 | 22111221131313111 |
5 | 140213224010010 |
6 | 5033300332553 |
7 | 542040425322 |
oct | 122551356725 |
9 | 31577672186 |
10 | 11100610005 |
11 | 4787006661 |
12 | 21996a4159 |
13 | 107ba229b4 |
14 | 7743bdb49 |
15 | 44e814970 |
hex | 295a5ddd5 |
11100610005 has 8 divisors (see below), whose sum is σ = 17760976032. Its totient is φ = 5920325328.
The previous prime is 11100609979. The next prime is 11100610021. The reversal of 11100610005 is 50001600111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11100610005 - 25 = 11100609973 is a prime.
It is a super-2 number, since 2×111006100052 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 740040667 = 11100610005 / (1 + 1 + 1 + 0 + 0 + 6 + 1 + 0 + 0 + 0 + 5).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 370020319 + ... + 370020348.
It is an arithmetic number, because the mean of its divisors is an integer number (2220122004).
Almost surely, 211100610005 is an apocalyptic number.
11100610005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11100610005 is a deficient number, since it is larger than the sum of its proper divisors (6660366027).
11100610005 is an equidigital number, since it uses as much as digits as its factorization.
11100610005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 740040675.
The product of its (nonzero) digits is 30, while the sum is 15.
The spelling of 11100610005 in words is "eleven billion, one hundred million, six hundred ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •