Base | Representation |
---|---|
bin | 1101101000100… |
… | …10100110001101 |
3 | 21222012122110101 |
4 | 12310102212031 |
5 | 213234332312 |
6 | 15203211101 |
7 | 2556065011 |
oct | 664224615 |
9 | 258178411 |
10 | 114370957 |
11 | 59617658 |
12 | 32376a91 |
13 | 1a905a2c |
14 | 11292541 |
15 | a092a57 |
hex | 6d1298d |
114370957 has 2 divisors, whose sum is σ = 114370958. Its totient is φ = 114370956.
The previous prime is 114370939. The next prime is 114370961. The reversal of 114370957 is 759073411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75794436 + 38576521 = 8706^2 + 6211^2 .
It is a cyclic number.
It is not a de Polignac number, because 114370957 - 27 = 114370829 is a prime.
It is equal to p6538915 and since 114370957 and 6538915 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114370967) by changing a digit.
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 as a sum of consecutive naturals, namely, 57185478 + 57185479.
It is an arithmetic number, because the mean of its divisors is an integer number (57185479).
Almost surely, 2114370957 is an apocalyptic number.
It is an amenable number.
114370957 is a deficient number, since it is larger than the sum of its proper divisors (1).
114370957 is an equidigital number, since it uses as much as digits as its factorization.
114370957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 37.
The square root of 114370957 is about 10694.4357962447. The cubic root of 114370957 is about 485.4061245608.
The spelling of 114370957 in words is "one hundred fourteen million, three hundred seventy thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •