Search a number
-
+
20110001031 = 33744814853
BaseRepresentation
bin10010101110101001…
…100100001110000111
31220220111111220022000
4102232221210032013
5312141130013111
613123255040343
71311226121421
oct225651441607
956814456260
1020110001031
11858a63146a
123a929700b3
131b864105c3
14d8ab5b811
157ca748c56
hex4aea64387

20110001031 has 8 divisors (see below), whose sum is σ = 29792594160. Its totient is φ = 13406667336.

The previous prime is 20110001011. The next prime is 20110001039. The reversal of 20110001031 is 13010001102.

It is not a de Polignac number, because 20110001031 - 213 = 20109992839 is a prime.

It is a super-2 number, since 2×201100010312 (a number of 21 digits) contains 22 as substring.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20110001039) 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 7 ways as a sum of consecutive naturals, for example, 372407400 + ... + 372407453.

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

Almost surely, 220110001031 is an apocalyptic number.

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

20110001031 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 6, while the sum is 9.

Adding to 20110001031 its reverse (13010001102), we get a palindrome (33120002133).

The spelling of 20110001031 in words is "twenty billion, one hundred ten million, one thousand, thirty-one".

Divisors: 1 3 9 27 744814853 2234444559 6703333677 20110001031