Base | Representation |
---|---|
bin | 1110010010001001000010… |
… | …10110100011110110010100 |
3 | 11010012201210220000120201011 |
4 | 13021010201112203312110 |
5 | 13104103433240212110 |
6 | 150445221350342004 |
7 | 6421162353515062 |
oct | 711044126436624 |
9 | 133181726016634 |
10 | 31409655397780 |
11 | a00a83a695630 |
12 | 363349a05a904 |
13 | 146abc151a23a |
14 | 7a8342055032 |
15 | 39708592748a |
hex | 1c91215a3d94 |
31409655397780 has 96 divisors (see below), whose sum is σ = 72338693898240. Its totient is φ = 11361062160000.
The previous prime is 31409655397759. The next prime is 31409655397787. The reversal of 31409655397780 is 8779355690413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31409655397787) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1127760855 + ... + 1127788705.
It is an arithmetic number, because the mean of its divisors is an integer number (753528061440).
Almost surely, 231409655397780 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 31409655397780, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36169346949120).
31409655397780 is an abundant number, since it is smaller than the sum of its proper divisors (40929038500460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31409655397780 is a wasteful number, since it uses less digits than its factorization.
31409655397780 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54901 (or 54899 counting only the distinct ones).
The product of its (nonzero) digits is 171460800, while the sum is 67.
The spelling of 31409655397780 in words is "thirty-one trillion, four hundred nine billion, six hundred fifty-five million, three hundred ninety-seven thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •