Base | Representation |
---|---|
bin | 10011001101001010… |
… | …11011110110000000 |
3 | 222121121000021211210 |
4 | 21212211123312000 |
5 | 132104110232000 |
6 | 4423053010120 |
7 | 513342154314 |
oct | 114645336600 |
9 | 28547007753 |
10 | 10311024000 |
11 | 4411338a42 |
12 | 1bb9183940 |
13 | c84277c44 |
14 | 6db5a5b44 |
15 | 405348350 |
hex | 26695bd80 |
10311024000 has 256 divisors, whose sum is σ = 34501671360. Its totient is φ = 2723840000.
The previous prime is 10311023971. The next prime is 10311024001. The reversal of 10311024000 is 42011301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10311024001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5423050 + ... + 5424950.
Almost surely, 210311024000 is an apocalyptic number.
10311024000 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 10311024000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17250835680).
10311024000 is an abundant number, since it is smaller than the sum of its proper divisors (24190647360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10311024000 is a wasteful number, since it uses less digits than its factorization.
10311024000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2046 (or 2024 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10311024000 its reverse (42011301), we get a palindrome (10353035301).
The spelling of 10311024000 in words is "ten billion, three hundred eleven million, twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •