Base | Representation |
---|---|
bin | 10011101011011000… |
… | …11100101000011000 |
3 | 1000021021000020122000 |
4 | 21311230130220120 |
5 | 133114004123342 |
6 | 4504150201000 |
7 | 522540641142 |
oct | 116554345030 |
9 | 30237006560 |
10 | 10564520472 |
11 | 453143a660 |
12 | 206a053160 |
13 | cc4942c5c |
14 | 723111c92 |
15 | 41c71d44c |
hex | 275b1ca18 |
10564520472 has 64 divisors (see below), whose sum is σ = 32013705600. Its totient is φ = 3201369120.
The previous prime is 10564520459. The next prime is 10564520479. The reversal of 10564520472 is 27402546501.
It is a happy number.
10564520472 is a `hidden beast` number, since 1 + 0 + 5 + 64 + 520 + 4 + 72 = 666.
It is a super-2 number, since 2×105645204722 (a number of 21 digits) contains 22 as substring.
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 (10564520479) 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, 2220798 + ... + 2225549.
It is an arithmetic number, because the mean of its divisors is an integer number (500214150).
Almost surely, 210564520472 is an apocalyptic number.
10564520472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10564520472 is an abundant number, since it is smaller than the sum of its proper divisors (21449185128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10564520472 is a wasteful number, since it uses less digits than its factorization.
10564520472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4446373 (or 4446363 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 36.
The spelling of 10564520472 in words is "ten billion, five hundred sixty-four million, five hundred twenty thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •