Base | Representation |
---|---|
bin | 11110000101010110… |
… | …111001001000110000 |
3 | 10002101012011211111122 |
4 | 132011112321020300 |
5 | 1012123322021000 |
6 | 22501151001412 |
7 | 2222322451052 |
oct | 360526711060 |
9 | 102335154448 |
10 | 32302142000 |
11 | 12776798427 |
12 | 6315b09268 |
13 | 307a30a1bb |
14 | 17c60b38d2 |
15 | c90cc0085 |
hex | 7855b9230 |
32302142000 has 160 divisors (see below), whose sum is σ = 83210924160. Its totient is φ = 12085862400.
The previous prime is 32302141997. The next prime is 32302142021. The reversal of 32302142000 is 24120323.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 32302142000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5675156 + ... + 5680844.
It is an arithmetic number, because the mean of its divisors is an integer number (520068276).
Almost surely, 232302142000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32302142000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41605462080).
32302142000 is an abundant number, since it is smaller than the sum of its proper divisors (50908782160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32302142000 is a wasteful number, since it uses less digits than its factorization.
32302142000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5896 (or 5880 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 32302142000 its reverse (24120323), we get a palindrome (32326262323).
The spelling of 32302142000 in words is "thirty-two billion, three hundred two million, one hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •