Base | Representation |
---|---|
bin | 1101101010100… |
… | …00101010001101 |
3 | 21222200120011111 |
4 | 12311100222031 |
5 | 213321001130 |
6 | 15212452021 |
7 | 2561204104 |
oct | 665205215 |
9 | 258616144 |
10 | 114625165 |
11 | 59780646 |
12 | 3247a011 |
13 | 1a994655 |
14 | 1131b03b |
15 | a0e302a |
hex | 6d50a8d |
114625165 has 4 divisors (see below), whose sum is σ = 137550204. Its totient is φ = 91700128.
The previous prime is 114625127. The next prime is 114625171. The reversal of 114625165 is 561526411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 55442916 + 59182249 = 7446^2 + 7693^2 .
It is a cyclic number.
It is not a de Polignac number, because 114625165 - 27 = 114625037 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11462512 + ... + 11462521.
It is an arithmetic number, because the mean of its divisors is an integer number (34387551).
Almost surely, 2114625165 is an apocalyptic number.
It is an amenable number.
114625165 is a deficient number, since it is larger than the sum of its proper divisors (22925039).
114625165 is an equidigital number, since it uses as much as digits as its factorization.
114625165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22925038.
The product of its digits is 7200, while the sum is 31.
The square root of 114625165 is about 10706.3142584178. The cubic root of 114625165 is about 485.7654897205.
The spelling of 114625165 in words is "one hundred fourteen million, six hundred twenty-five thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •