Search a number
-
+
115320320000 = 21254107421
BaseRepresentation
bin110101101100110100…
…0000111000000000000
3102000122212112020100222
41223121220013000000
53342134000220000
6124551042402212
711221513355324
oct1533150070000
9360585466328
10115320320000
11449a8350296
121a424660368
13ab4a81c552
14581da27984
152eee223a85
hex1ad9a07000

115320320000 has 260 divisors, whose sum is σ = 291557465496. Its totient is φ = 45588480000.

The previous prime is 115320319997. The next prime is 115320320033. The reversal of 115320320000 is 23023511.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 273919790 + ... + 273920210.

Almost surely, 2115320320000 is an apocalyptic number.

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

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

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

115320320000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 115320320000 its reverse (23023511), we get a palindrome (115343343511).

The spelling of 115320320000 in words is "one hundred fifteen billion, three hundred twenty million, three hundred twenty thousand".