Base | Representation |
---|---|
bin | 1110001111101100101101… |
… | …11001001010011000000000 |
3 | 11002220201011211220220202001 |
4 | 13013312112321022120000 |
5 | 13101220042340304312 |
6 | 150342501340233344 |
7 | 6412131513056626 |
oct | 707662671123000 |
9 | 132821154826661 |
10 | 31325728056832 |
11 | 9a88191912130 |
12 | 361b176b3b854 |
13 | 1463007853951 |
14 | 7a425d87b516 |
15 | 394cc2787057 |
hex | 1c7d96e4a600 |
31325728056832 has 480 divisors, whose sum is σ = 78131060434944. Its totient is φ = 12404745830400.
The previous prime is 31325728056827. The next prime is 31325728056839. The reversal of 31325728056832 is 23865082752313.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31325728056839) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1160499528 + ... + 1160526520.
Almost surely, 231325728056832 is an apocalyptic number.
31325728056832 is a gapful number since it is divisible by the number (32) 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 31325728056832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39065530217472).
31325728056832 is an abundant number, since it is smaller than the sum of its proper divisors (46805332378112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31325728056832 is a wasteful number, since it uses less digits than its factorization.
31325728056832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27110 (or 27077 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 55.
The spelling of 31325728056832 in words is "thirty-one trillion, three hundred twenty-five billion, seven hundred twenty-eight million, fifty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •