Base | Representation |
---|---|
bin | 10011011011011001… |
… | …11010000100000100 |
3 | 222220220200101220002 |
4 | 21231230322010010 |
5 | 132330142021200 |
6 | 4443000100432 |
7 | 516322064243 |
oct | 115554720404 |
9 | 28826611802 |
10 | 10430423300 |
11 | 447277a450 |
12 | 2031164718 |
13 | ca2c2160b |
14 | 70d3a695a |
15 | 410a80bd5 |
hex | 26db3a104 |
10430423300 has 144 divisors (see below), whose sum is σ = 25355877120. Its totient is φ = 3691776000.
The previous prime is 10430423299. The next prime is 10430423351. The reversal of 10430423300 is 332403401.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 11838860 + ... + 11839740.
It is an arithmetic number, because the mean of its divisors is an integer number (176082480).
Almost surely, 210430423300 is an apocalyptic number.
10430423300 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 10430423300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12677938560).
10430423300 is an abundant number, since it is smaller than the sum of its proper divisors (14925453820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10430423300 is a wasteful number, since it uses less digits than its factorization.
10430423300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182 (or 1175 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 10430423300 its reverse (332403401), we get a palindrome (10762826701).
The spelling of 10430423300 in words is "ten billion, four hundred thirty million, four hundred twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •