Base | Representation |
---|---|
bin | 11101100010001101… |
… | …001100000110100000 |
3 | 10000212002110121122100 |
4 | 131202031030012200 |
5 | 1004421333130210 |
6 | 22322442410400 |
7 | 2201601626040 |
oct | 354215140640 |
9 | 100762417570 |
10 | 31712395680 |
11 | 124a3903279 |
12 | 6190500a00 |
13 | 2cb5091794 |
14 | 176ba39720 |
15 | c5912a5c0 |
hex | 76234c1a0 |
31712395680 has 288 divisors, whose sum is σ = 130954247424. Its totient is φ = 6822125568.
The previous prime is 31712395669. The next prime is 31712395709. The reversal of 31712395680 is 8659321713.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 78829 + ... + 263891.
It is an arithmetic number, because the mean of its divisors is an integer number (454702248).
Almost surely, 231712395680 is an apocalyptic number.
31712395680 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 31712395680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65477123712).
31712395680 is an abundant number, since it is smaller than the sum of its proper divisors (99241851744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31712395680 is a wasteful number, since it uses less digits than its factorization.
31712395680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185108 (or 185097 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The spelling of 31712395680 in words is "thirty-one billion, seven hundred twelve million, three hundred ninety-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •