Base | Representation |
---|---|
bin | 10011000010111101… |
… | …11001011010000000 |
3 | 222101121221100201102 |
4 | 21201132321122000 |
5 | 131420202032000 |
6 | 4410354153532 |
7 | 511252445531 |
oct | 114136713200 |
9 | 28347840642 |
10 | 10225424000 |
11 | 4377a92440 |
12 | 1b945828a8 |
13 | c6c60695c |
14 | 6d0082688 |
15 | 3eca8a3d5 |
hex | 2617b9680 |
10225424000 has 128 divisors (see below), whose sum is σ = 27734616000. Its totient is φ = 3718272000.
The previous prime is 10225423969. The next prime is 10225424051. The reversal of 10225424000 is 42452201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
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 15 ways as a sum of consecutive naturals, for example, 146951 + ... + 205049.
Almost surely, 210225424000 is an apocalyptic number.
10225424000 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 10225424000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13867308000).
10225424000 is an abundant number, since it is smaller than the sum of its proper divisors (17509192000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10225424000 is an equidigital number, since it uses as much as digits as its factorization.
10225424000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58139 (or 58117 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 20.
Adding to 10225424000 its reverse (42452201), we get a palindrome (10267876201).
The spelling of 10225424000 in words is "ten billion, two hundred twenty-five million, four hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •