Base | Representation |
---|---|
bin | 10101100011001011… |
… | …01111101011100100 |
3 | 1002212021212020022220 |
4 | 22301211233223210 |
5 | 142143231141302 |
6 | 5152004152340 |
7 | 556462150545 |
oct | 126145575344 |
9 | 32767766286 |
10 | 11569396452 |
11 | 49a7693879 |
12 | 22aa6986b0 |
13 | 1124b99623 |
14 | 7ba76c4cc |
15 | 47aa644bc |
hex | 2b196fae4 |
11569396452 has 48 divisors (see below), whose sum is σ = 27347315520. Its totient is φ = 3806494848.
The previous prime is 11569396339. The next prime is 11569396469. The reversal of 11569396452 is 25469396511.
It is a junction number, because it is equal to n+sod(n) for n = 11569396395 and 11569396404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268518 + ... + 308610.
It is an arithmetic number, because the mean of its divisors is an integer number (569735740).
Almost surely, 211569396452 is an apocalyptic number.
11569396452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11569396452 is an abundant number, since it is smaller than the sum of its proper divisors (15777919068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11569396452 is a wasteful number, since it uses less digits than its factorization.
11569396452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40412 (or 40410 counting only the distinct ones).
The product of its digits is 1749600, while the sum is 51.
The spelling of 11569396452 in words is "eleven billion, five hundred sixty-nine million, three hundred ninety-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •