Base | Representation |
---|---|
bin | 10101011101101100… |
… | …00011100011101000 |
3 | 1002202002012100110122 |
4 | 22232312003203220 |
5 | 142044433344040 |
6 | 5143241102412 |
7 | 555362530646 |
oct | 125666034350 |
9 | 32662170418 |
10 | 11523340520 |
11 | 498369731a |
12 | 2297187a08 |
13 | 11184924b3 |
14 | 7b45c0196 |
15 | 4769b81b5 |
hex | 2aed838e8 |
11523340520 has 64 divisors (see below), whose sum is σ = 27466004880. Its totient is φ = 4336091136.
The previous prime is 11523340511. The next prime is 11523340547. The reversal of 11523340520 is 2504332511.
It is a happy number.
11523340520 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 9349729636 + 2173610884 = 96694^2 + 46622^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 11523340520.
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, 2756672 + ... + 2760848.
Almost surely, 211523340520 is an apocalyptic number.
11523340520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11523340520 is an abundant number, since it is smaller than the sum of its proper divisors (15942664360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11523340520 is a wasteful number, since it uses less digits than its factorization.
11523340520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8262 (or 8258 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The spelling of 11523340520 in words is "eleven billion, five hundred twenty-three million, three hundred forty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •