Base | Representation |
---|---|
bin | 10011001101010100… |
… | …00100101110000000 |
3 | 222121200022001212211 |
4 | 21212222010232000 |
5 | 132104413140000 |
6 | 4423135031504 |
7 | 513355410436 |
oct | 114652045600 |
9 | 28550261784 |
10 | 10312240000 |
11 | 4411a995a7 |
12 | 1bb966b594 |
13 | c845b257a |
14 | 6db800d56 |
15 | 4054d87ba |
hex | 266a84b80 |
10312240000 has 80 divisors (see below), whose sum is σ = 25671876120. Its totient is φ = 4124864000.
The previous prime is 10312239991. The next prime is 10312240013. The reversal of 10312240000 is 4221301.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 15549 + ... + 144451.
Almost surely, 210312240000 is an apocalyptic number.
10312240000 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 10312240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12835938060).
10312240000 is an abundant number, since it is smaller than the sum of its proper divisors (15359636120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10312240000 is an frugal number, since it uses more digits than its factorization.
10312240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128937 (or 128910 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 10312240000 its reverse (4221301), we get a palindrome (10316461301).
The spelling of 10312240000 in words is "ten billion, three hundred twelve million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •