Base | Representation |
---|---|
bin | 1101101000010… |
… | …11101001110101 |
3 | 21222011012110001 |
4 | 12310023221311 |
5 | 213232430032 |
6 | 15202431301 |
7 | 2555616052 |
oct | 664135165 |
9 | 258135401 |
10 | 114342517 |
11 | 595a8253 |
12 | 32362531 |
13 | 1a8c5ac3 |
14 | 11286029 |
15 | a0893e7 |
hex | 6d0ba75 |
114342517 has 2 divisors, whose sum is σ = 114342518. Its totient is φ = 114342516.
The previous prime is 114342509. The next prime is 114342541. The reversal of 114342517 is 715243411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 63776196 + 50566321 = 7986^2 + 7111^2 .
It is a cyclic number.
It is not a de Polignac number, because 114342517 - 23 = 114342509 is a prime.
It is a super-2 number, since 2×1143425172 = 26148422387790578, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114340517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57171258 + 57171259.
It is an arithmetic number, because the mean of its divisors is an integer number (57171259).
Almost surely, 2114342517 is an apocalyptic number.
It is an amenable number.
114342517 is a deficient number, since it is larger than the sum of its proper divisors (1).
114342517 is an equidigital number, since it uses as much as digits as its factorization.
114342517 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3360, while the sum is 28.
The square root of 114342517 is about 10693.1060501615. The cubic root of 114342517 is about 485.3658867972.
Adding to 114342517 its reverse (715243411), we get a palindrome (829585928).
It can be divided in two parts, 1143 and 42517, that added together give a triangular number (43660 = T295).
The spelling of 114342517 in words is "one hundred fourteen million, three hundred forty-two thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •