Search a number
-
+
114830352 = 243371323127
BaseRepresentation
bin1101101100000…
…10110000010000
322000001222122000
412312002300100
5213344032402
615221114000
72563020240
oct666026020
9260058560
10114830352
115990081a
1232558900
131aa36b70
1411371b20
15a133c1c
hex6d82c10

114830352 has 320 divisors, whose sum is σ = 426639360. Its totient is φ = 28740096.

The previous prime is 114830347. The next prime is 114830389. The reversal of 114830352 is 253038411.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 904113 + ... + 904239.

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

Almost surely, 2114830352 is an apocalyptic number.

114830352 is a gapful number since it is divisible by the number (12) 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 114830352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213319680).

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

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

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

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

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

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

The square root of 114830352 is about 10715.8924966612. The cubic root of 114830352 is about 486.0551682534.

Adding to 114830352 its reverse (253038411), we get a palindrome (367868763).

The spelling of 114830352 in words is "one hundred fourteen million, eight hundred thirty thousand, three hundred fifty-two".