Base | Representation |
---|---|
bin | 111011101111… |
… | …1001111000110 |
3 | 2011221101012000 |
4 | 1313133033012 |
5 | 31004314303 |
6 | 3035210130 |
7 | 530145633 |
oct | 167371706 |
9 | 64841160 |
10 | 31323078 |
11 | 16754546 |
12 | a5a6946 |
13 | 6649287 |
14 | 423518a |
15 | 2b3ada3 |
hex | 1ddf3c6 |
31323078 has 64 divisors (see below), whose sum is σ = 74520000. Its totient is φ = 9718272.
The previous prime is 31323023. The next prime is 31323107. The reversal of 31323078 is 87032313.
It is a super-2 number, since 2×313230782 = 1962270430788168, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 136668 + ... + 136896.
It is an arithmetic number, because the mean of its divisors is an integer number (1164375).
Almost surely, 231323078 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31323078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37260000).
31323078 is an abundant number, since it is smaller than the sum of its proper divisors (43196922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31323078 is a wasteful number, since it uses less digits than its factorization.
31323078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406 (or 400 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 31323078 is about 5596.7024219624. The cubic root of 31323078 is about 315.2255980289.
The spelling of 31323078 in words is "thirty-one million, three hundred twenty-three thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •