Base | Representation |
---|---|
bin | 1110010111101110101101… |
… | …01011010111011001011000 |
3 | 11010220002110010211101012210 |
4 | 13023313112223113121120 |
5 | 13120230213034321140 |
6 | 151113335400235120 |
7 | 6441100664460000 |
oct | 713672653273130 |
9 | 133802403741183 |
10 | 31601676088920 |
11 | a0842173309a3 |
12 | 366474946baa0 |
13 | 148304368c182 |
14 | 7b375a4d7000 |
15 | 39c0735dbd80 |
hex | 1cbdd6ad7658 |
31601676088920 has 320 divisors, whose sum is σ = 110648101086720. Its totient is φ = 7220052225792.
The previous prime is 31601676088903. The next prime is 31601676088951. The reversal of 31601676088920 is 2988067610613.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 686566947 + ... + 686612973.
It is an arithmetic number, because the mean of its divisors is an integer number (345775315896).
Almost surely, 231601676088920 is an apocalyptic number.
31601676088920 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 31601676088920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55324050543360).
31601676088920 is an abundant number, since it is smaller than the sum of its proper divisors (79046424997800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31601676088920 is a wasteful number, since it uses less digits than its factorization.
31601676088920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48452 (or 48427 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 57.
The spelling of 31601676088920 in words is "thirty-one trillion, six hundred one billion, six hundred seventy-six million, eighty-eight thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •