Base | Representation |
---|---|
bin | 11101010011001110… |
… | …001111001000111000 |
3 | 10000012120110000002120 |
4 | 131103032033020320 |
5 | 1003413004341044 |
6 | 22241502401240 |
7 | 2162430122061 |
oct | 352316171070 |
9 | 100176400076 |
10 | 31461012024 |
11 | 12384a14a92 |
12 | 6120290220 |
13 | 2c74c86360 |
14 | 17464bd568 |
15 | c42021519 |
hex | 75338f238 |
31461012024 has 128 divisors (see below), whose sum is σ = 89024140800. Its totient is φ = 9192522240.
The previous prime is 31461011999. The next prime is 31461012031. The reversal of 31461012024 is 42021016413.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 31461011985 and 31461012003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 981694 + ... + 1013234.
It is an arithmetic number, because the mean of its divisors is an integer number (695501100).
Almost surely, 231461012024 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 31461012024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44512070400).
31461012024 is an abundant number, since it is smaller than the sum of its proper divisors (57563128776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31461012024 is a wasteful number, since it uses less digits than its factorization.
31461012024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31725 (or 31721 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 31461012024 its reverse (42021016413), we get a palindrome (73482028437).
The spelling of 31461012024 in words is "thirty-one billion, four hundred sixty-one million, twelve thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •