Search a number
-
+
10115105000 = 2354711134347
BaseRepresentation
bin10010110101110100…
…00100000011101000
3222002221100120111112
421122322010003220
5131203431330000
64351413445452
7505442655020
oct113272040350
928087316445
1010115105000
114320793110
121b63640888
13c527bc340
146bd566a80
153e3048235
hex25ae840e8

10115105000 has 640 divisors, whose sum is σ = 33253355520. Its totient is φ = 2782080000.

The previous prime is 10115104981. The next prime is 10115105023. The reversal of 10115105000 is 50151101.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 215214977 + ... + 215215023.

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

Almost surely, 210115105000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 25, while the sum is 14.

Adding to 10115105000 its reverse (50151101), we get a palindrome (10165256101).

The spelling of 10115105000 in words is "ten billion, one hundred fifteen million, one hundred five thousand".