Base | Representation |
---|---|
bin | 1101101000010… |
… | …00111011100001 |
3 | 21222010122010212 |
4 | 12310020323201 |
5 | 213232100421 |
6 | 15202303505 |
7 | 2555541404 |
oct | 664107341 |
9 | 258118125 |
10 | 114331361 |
11 | 5959a931 |
12 | 32357b95 |
13 | 1a8c09c1 |
14 | 11281d3b |
15 | a085e5b |
hex | 6d08ee1 |
114331361 has 2 divisors, whose sum is σ = 114331362. Its totient is φ = 114331360.
The previous prime is 114331337. The next prime is 114331363. The reversal of 114331361 is 163133411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63123025 + 51208336 = 7945^2 + 7156^2 .
It is a cyclic number.
It is not a de Polignac number, because 114331361 - 222 = 110137057 is a prime.
It is a super-2 number, since 2×1143313612 = 26143320216224642, which contains 22 as substring.
Together with 114331363, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (114331363) 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, 57165680 + 57165681.
It is an arithmetic number, because the mean of its divisors is an integer number (57165681).
Almost surely, 2114331361 is an apocalyptic number.
It is an amenable number.
114331361 is a deficient number, since it is larger than the sum of its proper divisors (1).
114331361 is an equidigital number, since it uses as much as digits as its factorization.
114331361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 23.
The square root of 114331361 is about 10692.5843929333. The cubic root of 114331361 is about 485.3501011323.
Adding to 114331361 its reverse (163133411), we get a palindrome (277464772).
The spelling of 114331361 in words is "one hundred fourteen million, three hundred thirty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •