Base | Representation |
---|---|
bin | 10101100010100110… |
… | …00111011111010000 |
3 | 1002211221200010210220 |
4 | 22301103013133100 |
5 | 142141003410412 |
6 | 5151311353040 |
7 | 556402512006 |
oct | 126123073720 |
9 | 32757603726 |
10 | 11564513232 |
11 | 49a4958a58 |
12 | 22a8b22780 |
13 | 1123b79a4c |
14 | 7b9c5aa76 |
15 | 47a3ec68c |
hex | 2b14c77d0 |
11564513232 has 80 divisors (see below), whose sum is σ = 30081699648. Its totient is φ = 3828259840.
The previous prime is 11564513161. The next prime is 11564513291. The reversal of 11564513232 is 23231546511.
11564513232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11564513193 and 11564513202.
It is a congruent number.
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, 5154703 + ... + 5156945.
Almost surely, 211564513232 is an apocalyptic number.
11564513232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11564513232 is an abundant number, since it is smaller than the sum of its proper divisors (18517186416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11564513232 is a wasteful number, since it uses less digits than its factorization.
11564513232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2948 (or 2942 counting only the distinct ones).
The product of its digits is 21600, while the sum is 33.
The spelling of 11564513232 in words is "eleven billion, five hundred sixty-four million, five hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •