Search a number
-
+
31105012 = 2237210169
BaseRepresentation
bin111011010100…
…1111111110100
32011112022001111
41312221333310
530430330022
63030404404
7525250111
oct166517764
964468044
1031105012
1116615724
12a500704
1365a0c43
1441b9908
152ae6477
hex1da9ff4

31105012 has 12 divisors (see below), whose sum is σ = 55905220. Its totient is φ = 15132096.

The previous prime is 31104989. The next prime is 31105013. The reversal of 31105012 is 21050113.

It can be written as a sum of positive squares in 2 ways, for example, as 14409616 + 16695396 = 3796^2 + 4086^2 .

It is a junction number, because it is equal to n+sod(n) for n = 31104983 and 31105001.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (31105013) by changing a digit.

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 3 ways as a sum of consecutive naturals, for example, 104937 + ... + 105232.

Almost surely, 231105012 is an apocalyptic number.

It is an amenable number.

31105012 is a deficient number, since it is larger than the sum of its proper divisors (24800208).

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

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

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

The product of its (nonzero) digits is 30, while the sum is 13.

The square root of 31105012 is about 5577.1867460217. The cubic root of 31105012 is about 314.4923780066.

Adding to 31105012 its reverse (21050113), we get a palindrome (52155125).

The spelling of 31105012 in words is "thirty-one million, one hundred five thousand, twelve".

Divisors: 1 2 4 37 74 148 210169 420338 840676 7776253 15552506 31105012