Base | Representation |
---|---|
bin | 110101110101… |
… | …000000100101 |
3 | 222112220022122 |
4 | 311311000211 |
5 | 12103021012 |
6 | 1222235325 |
7 | 230640143 |
oct | 65650045 |
9 | 28486278 |
10 | 14110757 |
11 | 7a68691 |
12 | 4885b45 |
13 | 2c0097b |
14 | 1c34593 |
15 | 138ae72 |
hex | d75025 |
14110757 has 2 divisors, whose sum is σ = 14110758. Its totient is φ = 14110756.
The previous prime is 14110741. The next prime is 14110769. The reversal of 14110757 is 75701141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9449476 + 4661281 = 3074^2 + 2159^2 .
It is a cyclic number.
It is not a de Polignac number, because 14110757 - 24 = 14110741 is a prime.
It is a super-2 number, since 2×141107572 = 398226926226098, which contains 22 as substring.
It is a Chen prime.
It is equal to p916820 and since 14110757 and 916820 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 (14110717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7055378 + 7055379.
It is an arithmetic number, because the mean of its divisors is an integer number (7055379).
Almost surely, 214110757 is an apocalyptic number.
It is an amenable number.
14110757 is a deficient number, since it is larger than the sum of its proper divisors (1).
14110757 is an equidigital number, since it uses as much as digits as its factorization.
14110757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 980, while the sum is 26.
The square root of 14110757 is about 3756.4287561459. The cubic root of 14110757 is about 241.6481294276.
Adding to 14110757 its reverse (75701141), we get a palindrome (89811898).
The spelling of 14110757 in words is "fourteen million, one hundred ten thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •