Base | Representation |
---|---|
bin | 10011011001010101… |
… | …00010010011110100 |
3 | 222212200221110020002 |
4 | 21230222202103310 |
5 | 132311213241000 |
6 | 4441135130432 |
7 | 516021151004 |
oct | 115452422364 |
9 | 28780843202 |
10 | 10413024500 |
11 | 446397647a |
12 | 2027373a18 |
13 | c9c43c178 |
14 | 70ad58004 |
15 | 40e2958d5 |
hex | 26caa24f4 |
10413024500 has 48 divisors (see below), whose sum is σ = 22775712960. Its totient is φ = 4159044000.
The previous prime is 10413024493. The next prime is 10413024521. The reversal of 10413024500 is 542031401.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 330431 + ... + 360569.
It is an arithmetic number, because the mean of its divisors is an integer number (474494020).
Almost surely, 210413024500 is an apocalyptic number.
10413024500 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 10413024500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11387856480).
10413024500 is an abundant number, since it is smaller than the sum of its proper divisors (12362688460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10413024500 is a wasteful number, since it uses less digits than its factorization.
10413024500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30849 (or 30837 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 10413024500 its reverse (542031401), we get a palindrome (10955055901).
The spelling of 10413024500 in words is "ten billion, four hundred thirteen million, twenty-four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •