Base | Representation |
---|---|
bin | 10101100100000001… |
… | …10010000100111001 |
3 | 1002212210012022211100 |
4 | 22302000302010321 |
5 | 142202034443103 |
6 | 5152420122013 |
7 | 556606330443 |
oct | 126200620471 |
9 | 32783168740 |
10 | 11576484153 |
11 | 4a00694983 |
12 | 22b0b36309 |
13 | 11264ab730 |
14 | 7bb695493 |
15 | 47b4b45a3 |
hex | 2b2032139 |
11576484153 has 12 divisors (see below), whose sum is σ = 18007864420. Its totient is φ = 7123990176.
The previous prime is 11576484151. The next prime is 11576484173. The reversal of 11576484153 is 35148467511.
11576484153 is a `hidden beast` number, since 1 + 15 + 7 + 6 + 484 + 153 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5503710969 + 6072773184 = 74187^2 + 77928^2 .
It is not a de Polignac number, because 11576484153 - 21 = 11576484151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11576484099 and 11576484108.
It is not an unprimeable number, because it can be changed into a prime (11576484151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49472038 + ... + 49472271.
Almost surely, 211576484153 is an apocalyptic number.
11576484153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11576484153 is a deficient number, since it is larger than the sum of its proper divisors (6431380267).
11576484153 is a wasteful number, since it uses less digits than its factorization.
11576484153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98944328 (or 98944325 counting only the distinct ones).
The product of its digits is 403200, while the sum is 45.
The spelling of 11576484153 in words is "eleven billion, five hundred seventy-six million, four hundred eighty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •