Search a number
-
+
103059157500 = 22325413227103
BaseRepresentation
bin101111111111011001…
…1011111000111111100
3100212000100222122102100
41133332303133013330
53142031121020000
6115202243225100
710305621246015
oct1377663370774
9325010878370
10103059157500
113a786231442
1217b82378190
139945537600
144db946600c
152a32ab6a00
hex17fecdf1fc

103059157500 has 270 divisors, whose sum is σ = 352514434272. Its totient is φ = 25367472000.

The previous prime is 103059157489. The next prime is 103059157507. The reversal of 103059157500 is 5751950301.

103059157500 is a `hidden beast` number, since 1 + 0 + 30 + 59 + 1 + 575 + 0 + 0 = 666.

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

It is a congruent number.

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

It is a polite number, since it can be written in 89 ways as a sum of consecutive naturals, for example, 3788949 + ... + 3816051.

Almost surely, 2103059157500 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 23625, while the sum is 36.

The spelling of 103059157500 in words is "one hundred three billion, fifty-nine million, one hundred fifty-seven thousand, five hundred".