Base | Representation |
---|---|
bin | 10110001100001011… |
… | …01001110110000000 |
3 | 1010202020222121211000 |
4 | 23012011221312000 |
5 | 143344301233342 |
6 | 5250051252000 |
7 | 601136266005 |
oct | 130605516600 |
9 | 33666877730 |
10 | 11913305472 |
11 | 5063828802 |
12 | 23858aa000 |
13 | 117b1cc2a3 |
14 | 8102d18ac |
15 | 49ad4844c |
hex | 2c6169d80 |
11913305472 has 128 divisors (see below), whose sum is σ = 35316684000. Its totient is φ = 3953498112.
The previous prime is 11913305461. The next prime is 11913305477. The reversal of 11913305472 is 27450331911.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11913305477) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 783898 + ... + 798950.
Almost surely, 211913305472 is an apocalyptic number.
11913305472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11913305472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17658342000).
11913305472 is an abundant number, since it is smaller than the sum of its proper divisors (23403378528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11913305472 is a wasteful number, since it uses less digits than its factorization.
11913305472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15305 (or 15287 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The spelling of 11913305472 in words is "eleven billion, nine hundred thirteen million, three hundred five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •