Search a number
-
+
31070016 = 26321719167
BaseRepresentation
bin111011010000…
…1011101000000
32011110112001100
41312201131000
530423220031
63025534400
7525043065
oct166413500
964415040
1031070016
11165a13aa
12a4a4400
13658b033
1441aac6c
152adade6
hex1da1740

31070016 has 168 divisors, whose sum is σ = 99852480. Its totient is φ = 9179136.

The previous prime is 31070009. The next prime is 31070021. The reversal of 31070016 is 61007013.

It is a Harshad number since it is a multiple of its sum of digits (18).

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 185965 + ... + 186131.

It is an arithmetic number, because the mean of its divisors is an integer number (594360).

Almost surely, 231070016 is an apocalyptic number.

31070016 is a gapful number since it is divisible by the number (36) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 31070016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49926240).

31070016 is an abundant number, since it is smaller than the sum of its proper divisors (68782464).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

31070016 is a wasteful number, since it uses less digits than its factorization.

31070016 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 221 (or 208 counting only the distinct ones).

The product of its (nonzero) digits is 126, while the sum is 18.

The square root of 31070016 is about 5574.0484389714. The cubic root of 31070016 is about 314.3743894606.

Adding to 31070016 its reverse (61007013), we get a palindrome (92077029).

The spelling of 31070016 in words is "thirty-one million, seventy thousand, sixteen".