Base | Representation |
---|---|
bin | 10011100000101110… |
… | …00111001000010100 |
3 | 1000001000122020021121 |
4 | 21300113013020110 |
5 | 132423102310200 |
6 | 4451232253324 |
7 | 520403245003 |
oct | 116027071024 |
9 | 30030566247 |
10 | 10475041300 |
11 | 4495984629 |
12 | 20440a1244 |
13 | cac2440b9 |
14 | 71529cc3a |
15 | 414945e1a |
hex | 2705c7214 |
10475041300 has 72 divisors (see below), whose sum is σ = 24427436544. Its totient is φ = 3884643840.
The previous prime is 10475041253. The next prime is 10475041321. The reversal of 10475041300 is 314057401.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67917 + ... + 159883.
It is an arithmetic number, because the mean of its divisors is an integer number (339269952).
Almost surely, 210475041300 is an apocalyptic number.
10475041300 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 10475041300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12213718272).
10475041300 is an abundant number, since it is smaller than the sum of its proper divisors (13952395244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10475041300 is a wasteful number, since it uses less digits than its factorization.
10475041300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92065 (or 92058 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 25.
Adding to 10475041300 its reverse (314057401), we get a palindrome (10789098701).
The spelling of 10475041300 in words is "ten billion, four hundred seventy-five million, forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.234 sec. • engine limits •