Base | Representation |
---|---|
bin | 10101011011111001… |
… | …11111100111001000 |
3 | 1002201001001101110000 |
4 | 22231330333213020 |
5 | 142032121212102 |
6 | 5141544323000 |
7 | 555121430361 |
oct | 125574774710 |
9 | 32631041400 |
10 | 11508382152 |
11 | 49761aa933 |
12 | 2292173460 |
13 | 1115355aa7 |
14 | 7b2608b68 |
15 | 47551101c |
hex | 2adf3f9c8 |
11508382152 has 80 divisors (see below), whose sum is σ = 34130283660. Its totient is φ = 3610469376.
The previous prime is 11508382133. The next prime is 11508382153. The reversal of 11508382152 is 25128380511.
It can be written as a sum of positive squares in 2 ways, for example, as 10963346436 + 545035716 = 104706^2 + 23346^2 .
It is a super-4 number, since 4×115083821524 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (11508382153) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 511333 + ... + 533364.
Almost surely, 211508382152 is an apocalyptic number.
11508382152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11508382152 is an abundant number, since it is smaller than the sum of its proper divisors (22621901508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11508382152 is a wasteful number, since it uses less digits than its factorization.
11508382152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1044732 (or 1044719 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 36.
The spelling of 11508382152 in words is "eleven billion, five hundred eight million, three hundred eighty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •