Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01100001011111001 |
3 | 1001122120122002200220 |
4 | 22111213030023321 |
5 | 140213100411210 |
6 | 5033235450253 |
7 | 542032361553 |
oct | 122547141371 |
9 | 31576562626 |
10 | 11100013305 |
11 | 4786739317 |
12 | 2199456989 |
13 | 107b874214 |
14 | 7742a64d3 |
15 | 44e747c70 |
hex | 2959cc2f9 |
11100013305 has 8 divisors (see below), whose sum is σ = 17760021312. Its totient is φ = 5920007088.
The previous prime is 11100013277. The next prime is 11100013307. The reversal of 11100013305 is 50331000111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11100013305 - 216 = 11099947769 is a prime.
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: 740000887 = 11100013305 / (1 + 1 + 1 + 0 + 0 + 0 + 1 + 3 + 3 + 0 + 5).
It is not an unprimeable number, because it can be changed into a prime (11100013307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 370000429 + ... + 370000458.
It is an arithmetic number, because the mean of its divisors is an integer number (2220002664).
Almost surely, 211100013305 is an apocalyptic number.
11100013305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11100013305 is a deficient number, since it is larger than the sum of its proper divisors (6660008007).
11100013305 is an equidigital number, since it uses as much as digits as its factorization.
11100013305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 740000895.
The product of its (nonzero) digits is 45, while the sum is 15.
Adding to 11100013305 its reverse (50331000111), we get a palindrome (61431013416).
The spelling of 11100013305 in words is "eleven billion, one hundred million, thirteen thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •