Search a number
-
+
20112737671051 = 37214691554179
BaseRepresentation
bin1001001001010110111001…
…00101011001011110001011
32122012202111021021120200221
410210223130211121132023
510114011341320433201
6110435355241410511
74144045250303404
oct444533445313613
978182437246627
1020112737671051
116454845093a03
122309b97199a37
13b2b813a26b2c
144d7666c7c9ab
1524d2a24a54a1
hex124adc95978b

20112737671051 has 6 divisors (see below), whose sum is σ = 20671016731260. Its totient is φ = 19569150165096.

The previous prime is 20112737671021. The next prime is 20112737671087. The reversal of 20112737671051 is 15017673721102.

It is not a de Polignac number, because 20112737671051 - 225 = 20112704116619 is a prime.

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7345775721 + ... + 7345778458.

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

Almost surely, 220112737671051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 123480, while the sum is 43.

The spelling of 20112737671051 in words is "twenty trillion, one hundred twelve billion, seven hundred thirty-seven million, six hundred seventy-one thousand, fifty-one".

Divisors: 1 37 1369 14691554179 543587504623 20112737671051