Base | Representation |
---|---|
bin | 11101001010011110… |
… | …010010011111100100 |
3 | 2222211100020110022201 |
4 | 131022132102133210 |
5 | 1003112420200444 |
6 | 22215140304244 |
7 | 2155665343660 |
oct | 351236223744 |
9 | 88740213281 |
10 | 31314225124 |
11 | 1230a0778a6 |
12 | 609b0a2084 |
13 | 2c50740ac0 |
14 | 1730bcd8a0 |
15 | c341c8dd4 |
hex | 74a7927e4 |
31314225124 has 96 divisors (see below), whose sum is σ = 68506221056. Its totient is φ = 12194012160.
The previous prime is 31314225113. The next prime is 31314225169. The reversal of 31314225124 is 42152241313.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 31314225092 and 31314225101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19317034 + ... + 19318654.
Almost surely, 231314225124 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 31314225124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34253110528).
31314225124 is an abundant number, since it is smaller than the sum of its proper divisors (37191995932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31314225124 is a wasteful number, since it uses less digits than its factorization.
31314225124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2445 (or 2443 counting only the distinct ones).
The product of its digits is 5760, while the sum is 28.
Adding to 31314225124 its reverse (42152241313), we get a palindrome (73466466437).
The spelling of 31314225124 in words is "thirty-one billion, three hundred fourteen million, two hundred twenty-five thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •