Search a number
-
+
115889697000 = 233453711171093
BaseRepresentation
bin110101111101110010…
…0000111000011101000
3102002010112220120210000
41223323210013003220
53344320230301000
6125123342223000
711241566112510
oct1537344070350
9362115816700
10115889697000
114516a7926a0
121a563284a60
13ac0b78570c
1458754bc840
1530341e3000
hex1afb9070e8

115889697000 has 1280 divisors, whose sum is σ = 535256916480. Its totient is φ = 22643712000.

The previous prime is 115889696977. The next prime is 115889697029. The reversal of 115889697000 is 796988511.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 106028454 + ... + 106029546.

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

Almost surely, 2115889697000 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 115889697000 in words is "one hundred fifteen billion, eight hundred eighty-nine million, six hundred ninety-seven thousand".