Search a number
-
+
1909005072 = 24313217109127
BaseRepresentation
bin111000111001001…
…0001101100010000
311221001010111122120
41301302101230100
512402201130242
6513232334240
765210163312
oct16162215420
94831114576
101909005072
1189a646847
124533a4380
13245667600
1414176d7b2
15b28db1ec
hex71c91b10

1909005072 has 240 divisors, whose sum is σ = 5751060480. Its totient is φ = 543449088.

The previous prime is 1909005067. The next prime is 1909005073. The reversal of 1909005072 is 2705009091.

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

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

Almost surely, 21909005072 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1909005072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2875530240).

1909005072 is an abundant number, since it is smaller than the sum of its proper divisors (3842055408).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 33.

The square root of 1909005072 is about 43692.1625923918. The cubic root of 1909005072 is about 1240.5159732685.

The spelling of 1909005072 in words is "one billion, nine hundred nine million, five thousand, seventy-two".