Base | Representation |
---|---|
bin | 1101101001111… |
… | …11100011111011 |
3 | 21222120000002122 |
4 | 12310333203323 |
5 | 213311231011 |
6 | 15211151455 |
7 | 2560462655 |
oct | 664774373 |
9 | 258500078 |
10 | 114555131 |
11 | 59732a69 |
12 | 3244558b |
13 | 1a96b802 |
14 | 112dd6d5 |
15 | a0cc3db |
hex | 6d3f8fb |
114555131 has 2 divisors, whose sum is σ = 114555132. Its totient is φ = 114555130.
The previous prime is 114555113. The next prime is 114555169. The reversal of 114555131 is 131555411.
Together with previous prime (114555113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 114555131 - 222 = 110360827 is a prime.
It is a super-2 number, since 2×1145551312 = 26245756076854322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114555131.
It is not a weakly prime, because it can be changed into another prime (114555431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57277565 + 57277566.
It is an arithmetic number, because the mean of its divisors is an integer number (57277566).
Almost surely, 2114555131 is an apocalyptic number.
114555131 is a deficient number, since it is larger than the sum of its proper divisors (1).
114555131 is an equidigital number, since it uses as much as digits as its factorization.
114555131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1500, while the sum is 26.
The square root of 114555131 is about 10703.0430719492. The cubic root of 114555131 is about 485.6665381182. Note that the first 3 decimals are identical.
The spelling of 114555131 in words is "one hundred fourteen million, five hundred fifty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •