Base | Representation |
---|---|
bin | 1101100111101… |
… | …00110101011101 |
3 | 21221222110020102 |
4 | 12303310311131 |
5 | 213221432203 |
6 | 15200430445 |
7 | 2555046422 |
oct | 663646535 |
9 | 257873212 |
10 | 114249053 |
11 | 59544006 |
12 | 32318425 |
13 | 1a8923b9 |
14 | 1125dd49 |
15 | a06b888 |
hex | 6cf4d5d |
114249053 has 2 divisors, whose sum is σ = 114249054. Its totient is φ = 114249052.
The previous prime is 114249029. The next prime is 114249097. The reversal of 114249053 is 350942411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60637369 + 53611684 = 7787^2 + 7322^2 .
It is a cyclic number.
It is not a de Polignac number, because 114249053 - 214 = 114232669 is a prime.
It is a super-2 number, since 2×1142490532 = 26105692222793618, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114249013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57124526 + 57124527.
It is an arithmetic number, because the mean of its divisors is an integer number (57124527).
Almost surely, 2114249053 is an apocalyptic number.
It is an amenable number.
114249053 is a deficient number, since it is larger than the sum of its proper divisors (1).
114249053 is an equidigital number, since it uses as much as digits as its factorization.
114249053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 114249053 is about 10688.7348643326. The cubic root of 114249053 is about 485.2336041189.
The spelling of 114249053 in words is "one hundred fourteen million, two hundred forty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •