Search a number
-
+
105002089500 = 2235371117531009
BaseRepresentation
bin110000111001010011…
…1001011110000011100
3101001000202221211001210
41201302213023300130
53210021013331000
6120123131104420
710405023014550
oct1416247136034
9331022854053
10105002089500
1140592a3aa70
1218424ba2110
139b94c20409
145121507860
152ae8455350
hex18729cbc1c

105002089500 has 768 divisors, whose sum is σ = 411662684160. Its totient is φ = 20127744000.

The previous prime is 105002089481. The next prime is 105002089529. The reversal of 105002089500 is 5980200501.

It is a super-2 number, since 2×1050020895002 (a number of 23 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (30).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 104064996 + ... + 104066004.

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

Almost surely, 2105002089500 is an apocalyptic number.

105002089500 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 105002089500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205831342080).

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

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

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 30.

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