Base | Representation |
---|---|
bin | 1101100110100… |
… | …01111101110000 |
3 | 21221201012022110 |
4 | 12303101331300 |
5 | 213202344344 |
6 | 15153405320 |
7 | 2553613131 |
oct | 663217560 |
9 | 257635273 |
10 | 114106224 |
11 | 59456771 |
12 | 32269840 |
13 | 1a84239b |
14 | 11223c88 |
15 | a03e3b9 |
hex | 6cd1f70 |
114106224 has 80 divisors (see below), whose sum is σ = 309408768. Its totient is φ = 36193536.
The previous prime is 114106217. The next prime is 114106231. The reversal of 114106224 is 422601411.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (114106217) and next prime (114106231).
It is a self number, because there is not a number n which added to its sum of digits gives 114106224.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82789 + ... + 84155.
Almost surely, 2114106224 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 114106224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154704384).
114106224 is an abundant number, since it is smaller than the sum of its proper divisors (195302544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114106224 is a wasteful number, since it uses less digits than its factorization.
114106224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462 (or 1456 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 114106224 is about 10682.0514883612. The cubic root of 114106224 is about 485.0313140939.
Adding to 114106224 its reverse (422601411), we get a palindrome (536707635).
The spelling of 114106224 in words is "one hundred fourteen million, one hundred six thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •