Base | Representation |
---|---|
bin | 1101101000111… |
… | …01111011001000 |
3 | 21222022000002201 |
4 | 12310131323020 |
5 | 213242323402 |
6 | 15204205544 |
7 | 2556350200 |
oct | 664357310 |
9 | 258260081 |
10 | 114417352 |
11 | 596494a5 |
12 | 323998b4 |
13 | 1a920b9a |
14 | 112a5400 |
15 | a0a1687 |
hex | 6d1dec8 |
114417352 has 48 divisors (see below), whose sum is σ = 253134720. Its totient is φ = 48333600.
The previous prime is 114417313. The next prime is 114417371. The reversal of 114417352 is 253714411.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 114417352.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25777 + ... + 29887.
It is an arithmetic number, because the mean of its divisors is an integer number (5273640).
Almost surely, 2114417352 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 114417352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126567360).
114417352 is an abundant number, since it is smaller than the sum of its proper divisors (138717368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114417352 is a wasteful number, since it uses less digits than its factorization.
114417352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4202 (or 4191 counting only the distinct ones).
The product of its digits is 3360, while the sum is 28.
The square root of 114417352 is about 10696.6046949488. The cubic root of 114417352 is about 485.4717512819.
It can be divided in two parts, 1144 and 17352, that added together give a square (18496 = 1362).
The spelling of 114417352 in words is "one hundred fourteen million, four hundred seventeen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •