Search a number
-
+
114856140 = 223571937389
BaseRepresentation
bin1101101100010…
…01000011001100
322000010022000010
412312021003030
5213400344030
615221433220
72563155360
oct666110314
9260108003
10114856140
1159919133
123256b810
131aa45819
141137b2a0
15a13b6b0
hex6d890cc

114856140 has 192 divisors, whose sum is σ = 398361600. Its totient is φ = 24136704.

The previous prime is 114856099. The next prime is 114856169. The reversal of 114856140 is 41658411.

114856140 = T223 + T224 + ... + T887.

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

It is a junction number, because it is equal to n+sod(n) for n = 114856098 and 114856107.

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, 295066 + ... + 295454.

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

Almost surely, 2114856140 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 114856140 is about 10717.0956886649. The cubic root of 114856140 is about 486.0915507727.

The spelling of 114856140 in words is "one hundred fourteen million, eight hundred fifty-six thousand, one hundred forty".