Search a number
-
+
15109270020 = 223251371199457
BaseRepresentation
bin11100001001001010…
…10010101000000100
31102222222202102222100
432010211102220010
5221420433120040
610535140032100
71043264450625
oct160445225004
942888672870
1015109270020
116453875219
122b18092630
13156a387080
14a34949a4c
155d66eab30
hex384952a04

15109270020 has 288 divisors, whose sum is σ = 50413708800. Its totient is φ = 3640412160.

The previous prime is 15109269983. The next prime is 15109270027. The reversal of 15109270020 is 2007290151.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 33061632 + ... + 33062088.

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

Almost surely, 215109270020 is an apocalyptic number.

15109270020 is a gapful number since it is divisible by the number (10) 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 15109270020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25206854400).

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

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

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

15109270020 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 15109270020 in words is "fifteen billion, one hundred nine million, two hundred seventy thousand, twenty".