Search a number
-
+
101000152000 = 26531121031013
BaseRepresentation
bin101111000010000010…
…1000000001111000000
3100122200212121022212101
41132010011000033000
53123322014331000
6114222051440144
710203610061356
oct1360405001700
9318625538771
10101000152000
1139919a53100
12176a88b6054
1396a7aa0b67
144c61c0b7d6
152961e4ae6a
hex17841403c0

101000152000 has 336 divisors, whose sum is σ = 277876138176. Its totient is φ = 36334848000.

The previous prime is 101000151979. The next prime is 101000152013. The reversal of 101000152000 is 251000101.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 99703494 + ... + 99704506.

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

Almost surely, 2101000152000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101000152000 its reverse (251000101), we get a palindrome (101251152101).

The spelling of 101000152000 in words is "one hundred one billion, one hundred fifty-two thousand".