Base | Representation |
---|---|
bin | 11100111000100111… |
… | …101011100110110000 |
3 | 2222001110121212112000 |
4 | 130320213223212300 |
5 | 1002004230304032 |
6 | 22125320334000 |
7 | 2145400402200 |
oct | 347047534660 |
9 | 88043555460 |
10 | 31014697392 |
11 | 12175a96218 |
12 | 6016914300 |
13 | 2c03679c63 |
14 | 1703100400 |
15 | c17c5ee7c |
hex | 7389eb9b0 |
31014697392 has 240 divisors, whose sum is σ = 108062369280. Its totient is φ = 8475933312.
The previous prime is 31014697387. The next prime is 31014697403. The reversal of 31014697392 is 29379641013.
31014697392 is a `hidden beast` number, since 31 + 0 + 1 + 469 + 73 + 92 = 666.
It is a super-2 number, since 2×310146973922 (a number of 22 digits) contains 22 as substring.
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 47 ways as a sum of consecutive naturals, for example, 455013 + ... + 518715.
It is an arithmetic number, because the mean of its divisors is an integer number (450259872).
Almost surely, 231014697392 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 31014697392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54031184640).
31014697392 is an abundant number, since it is smaller than the sum of its proper divisors (77047671888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31014697392 is a wasteful number, since it uses less digits than its factorization.
31014697392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63757 (or 63738 counting only the distinct ones).
The product of its (nonzero) digits is 244944, while the sum is 45.
The spelling of 31014697392 in words is "thirty-one billion, fourteen million, six hundred ninety-seven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •