Search a number
-
+
20116022 = 2194871087
BaseRepresentation
bin100110010111…
…1001000110110
31101211222222212
41030233020312
520122203042
61555053422
7332661203
oct114571066
941758885
1020116022
111039a513
1268a1272
134224194
142958caa
151b75482
hex132f236

20116022 has 16 divisors (see below), whose sum is σ = 31856640. Its totient is φ = 9500328.

The previous prime is 20116021. The next prime is 20116039. The reversal of 20116022 is 22061102.

It is a super-2 number, since 2×201160222 = 809308682208968, which contains 22 as substring.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17963 + ... + 19049.

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

Almost surely, 220116022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1595.

The product of its (nonzero) digits is 48, while the sum is 14.

The square root of 20116022 is about 4485.0888508479. The cubic root of 20116022 is about 271.9656368786.

Adding to 20116022 its reverse (22061102), we get a palindrome (42177124).

It can be divided in two parts, 2011602 and 2, that multiplied together give a palindrome (4023204).

The spelling of 20116022 in words is "twenty million, one hundred sixteen thousand, twenty-two".

Divisors: 1 2 19 38 487 974 1087 2174 9253 18506 20653 41306 529369 1058738 10058011 20116022