Search a number
-
+
20001131023 = 171577493867
BaseRepresentation
bin10010101000001010…
…010000101000001111
31220121220122201201111
4102220022100220033
5311430242143043
613104405352451
71305434544226
oct225012205017
956556581644
1020001131023
118534131855
123a62408727
131b699b2693
14d7a4dbcbd
157c0de109d
hex4a8290a0f

20001131023 has 8 divisors (see below), whose sum is σ = 21312560592. Its totient is φ = 18704689536.

The previous prime is 20001131021. The next prime is 20001131053. The reversal of 20001131023 is 32013110002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 20001131023 - 21 = 20001131021 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20001131021) 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, 3744265 + ... + 3749602.

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

Almost surely, 220001131023 is an apocalyptic number.

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

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

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

The sum of its prime factors is 7494041.

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

Adding to 20001131023 its reverse (32013110002), we get a palindrome (52014241025).

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

Divisors: 1 17 157 2669 7493867 127395739 1176537119 20001131023