Search a number
-
+
20009301921 = 327317607967
BaseRepresentation
bin10010101000101001…
…011011011110100001
31220122111000212002100
4102220221123132201
5311434340130141
613105300441013
71305564155130
oct225051333641
956574025070
1020009301921
118538802764
123a650a9169
131b6b5b382b
14d7b627917
157c19a70b6
hex4a8a5b7a1

20009301921 has 12 divisors (see below), whose sum is σ = 33031228672. Its totient is φ = 11433886776.

The previous prime is 20009301889. The next prime is 20009301959. The reversal of 20009301921 is 12910390002.

It is not a de Polignac number, because 20009301921 - 25 = 20009301889 is a prime.

It is a Duffinian number.

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

Almost surely, 220009301921 is an apocalyptic number.

20009301921 is a gapful number since it is divisible by the number (21) formed by its first and last digit.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 972, while the sum is 27.

Adding to 20009301921 its reverse (12910390002), we get a palindrome (32919691923).

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

Divisors: 1 3 7 9 21 63 317607967 952823901 2223255769 2858471703 6669767307 20009301921