Base | Representation |
---|---|
bin | 11101011000000100… |
… | …000110001100000000 |
3 | 10000102020021210221010 |
4 | 131120010012030000 |
5 | 1004044303140000 |
6 | 22253523400520 |
7 | 2164434421245 |
oct | 353004061400 |
9 | 100366253833 |
10 | 31542240000 |
11 | 12416854847 |
12 | 6143523140 |
13 | 2c88a5664b |
14 | 17531c55cc |
15 | c49218d50 |
hex | 758106300 |
31542240000 has 180 divisors, whose sum is σ = 104903463896. Its totient is φ = 8411136000.
The previous prime is 31542239987. The next prime is 31542240013. The reversal of 31542240000 is 4224513.
It is an interprime number because it is at equal distance from previous prime (31542239987) and next prime (31542240013).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 447144 + ... + 512856.
Almost surely, 231542240000 is an apocalyptic number.
31542240000 is a gapful number since it is divisible by the number (30) 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 31542240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52451731948).
31542240000 is an abundant number, since it is smaller than the sum of its proper divisors (73361223896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31542240000 is an frugal number, since it uses more digits than its factorization.
31542240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65752 (or 65723 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 21.
Adding to 31542240000 its reverse (4224513), we get a palindrome (31546464513).
The spelling of 31542240000 in words is "thirty-one billion, five hundred forty-two million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •