Base | Representation |
---|---|
bin | 1110010011101111101010… |
… | …10010101000100001010000 |
3 | 11010102000000120122020121220 |
4 | 13021313311102220201100 |
5 | 13111004302142330210 |
6 | 150530412411045040 |
7 | 6425152566323400 |
oct | 711676522504120 |
9 | 133360016566556 |
10 | 31464750745680 |
11 | a0311425699aa |
12 | 36420b5440780 |
13 | 1473161ac0a05 |
14 | 7aac8b386800 |
15 | 39870c7a9c70 |
hex | 1c9df54a8850 |
31464750745680 has 120 divisors (see below), whose sum is σ = 113465744057952. Its totient is φ = 7191943024896.
The previous prime is 31464750745679. The next prime is 31464750745721. The reversal of 31464750745680 is 8654705746413.
It is a tau number, because it is divible by the number of its divisors (120).
It is a hoax number, since the sum of its digits (60) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1337775262 + ... + 1337798781.
Almost surely, 231464750745680 is an apocalyptic number.
31464750745680 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
31464750745680 is an abundant number, since it is smaller than the sum of its proper divisors (82000993312272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31464750745680 is a wasteful number, since it uses less digits than its factorization.
31464750745680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2675574073 (or 2675574060 counting only the distinct ones).
The product of its (nonzero) digits is 67737600, while the sum is 60.
The spelling of 31464750745680 in words is "thirty-one trillion, four hundred sixty-four billion, seven hundred fifty million, seven hundred forty-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •