Base | Representation |
---|---|
bin | 1101101000100… |
… | …11011011101000 |
3 | 21222012211011000 |
4 | 12310103123220 |
5 | 213234440001 |
6 | 15203235000 |
7 | 2556110664 |
oct | 664233350 |
9 | 258184130 |
10 | 114374376 |
11 | 5961a186 |
12 | 32378a60 |
13 | 1a90745c |
14 | 112938a4 |
15 | a093a86 |
hex | 6d136e8 |
114374376 has 192 divisors, whose sum is σ = 357480000. Its totient is φ = 33747840.
The previous prime is 114374369. The next prime is 114374387. The reversal of 114374376 is 673473411.
It is a Harshad number since it is a multiple of its sum of digits (36).
Its product of digits (42336) is a multiple of the sum of its prime divisors (84).
It is a self number, because there is not a number n which added to its sum of digits gives 114374376.
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, 3689481 + ... + 3689511.
It is an arithmetic number, because the mean of its divisors is an integer number (1861875).
Almost surely, 2114374376 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114374376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178740000).
114374376 is an abundant number, since it is smaller than the sum of its proper divisors (243105624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114374376 is a wasteful number, since it uses less digits than its factorization.
114374376 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125 (or 84 counting only the distinct ones).
The product of its digits is 42336, while the sum is 36.
The square root of 114374376 is about 10694.5956445300. The cubic root of 114374376 is about 485.4109614152.
The spelling of 114374376 in words is "one hundred fourteen million, three hundred seventy-four thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •