Base | Representation |
---|---|
bin | 11101110010000101… |
… | …011100001110000000 |
3 | 10001112122202100200000 |
4 | 131302011130032000 |
5 | 1010443033100000 |
6 | 22405120400000 |
7 | 2211315213030 |
oct | 356205341600 |
9 | 101478670600 |
10 | 31978800000 |
11 | 12620220834 |
12 | 6245776000 |
13 | 3028328a84 |
14 | 17951858c0 |
15 | c72700000 |
hex | 77215c380 |
31978800000 has 1152 divisors, whose sum is σ = 139221089280. Its totient is φ = 7153920000.
The previous prime is 31978799947. The next prime is 31978800013. The reversal of 31978800000 is 887913.
It is a tau number, because it is divible by the number of its divisors (1152).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 680399977 + ... + 680400023.
It is an arithmetic number, because the mean of its divisors is an integer number (120851640).
Almost surely, 231978800000 is an apocalyptic number.
31978800000 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 31978800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69610544640).
31978800000 is an abundant number, since it is smaller than the sum of its proper divisors (107242289280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31978800000 is an frugal number, since it uses more digits than its factorization.
31978800000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108 (or 64 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The spelling of 31978800000 in words is "thirty-one billion, nine hundred seventy-eight million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •