Base | Representation |
---|---|
bin | 10100110111110100… |
… | …00100110101101000 |
3 | 1001220221100211210010 |
4 | 22123322010311220 |
5 | 140422120032430 |
6 | 5051531251520 |
7 | 544454155113 |
oct | 123372046550 |
9 | 31827324703 |
10 | 11205627240 |
11 | 4830314665 |
12 | 22088a9ba0 |
13 | 1097702082 |
14 | 78431957a |
15 | 458b5acb0 |
hex | 29be84d68 |
11205627240 has 64 divisors (see below), whose sum is σ = 33623948160. Its totient is φ = 2987539200.
The previous prime is 11205627211. The next prime is 11205627263. The reversal of 11205627240 is 4272650211.
11205627240 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 11205627198 and 11205627207.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 966357 + ... + 977883.
It is an arithmetic number, because the mean of its divisors is an integer number (525374190).
Almost surely, 211205627240 is an apocalyptic number.
11205627240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11205627240 is an abundant number, since it is smaller than the sum of its proper divisors (22418320920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11205627240 is a wasteful number, since it uses less digits than its factorization.
11205627240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19642 (or 19638 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The spelling of 11205627240 in words is "eleven billion, two hundred five million, six hundred twenty-seven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •