Base | Representation |
---|---|
bin | 10010111011101100… |
… | …01110011011100000 |
3 | 222020101011120110010 |
4 | 21131312032123200 |
5 | 131304043234220 |
6 | 4400335004520 |
7 | 506612143224 |
oct | 113566163340 |
9 | 28211146403 |
10 | 10164430560 |
11 | 4346613139 |
12 | 1b78069740 |
13 | c5ca9c76b |
14 | 6c5d26784 |
15 | 3e753d1e0 |
hex | 25dd8e6e0 |
10164430560 has 288 divisors, whose sum is σ = 34758097920. Its totient is φ = 2495193088.
The previous prime is 10164430559. The next prime is 10164430579. The reversal of 10164430560 is 6503446101.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6519061 + ... + 6520619.
It is an arithmetic number, because the mean of its divisors is an integer number (120687840).
Almost surely, 210164430560 is an apocalyptic number.
10164430560 is a gapful number since it is divisible by the number (10) 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 10164430560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17379048960).
10164430560 is an abundant number, since it is smaller than the sum of its proper divisors (24593667360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10164430560 is a wasteful number, since it uses less digits than its factorization.
10164430560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1658 (or 1633 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 10164430560 its reverse (6503446101), we get a palindrome (16667876661).
The spelling of 10164430560 in words is "ten billion, one hundred sixty-four million, four hundred thirty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •