Base | Representation |
---|---|
bin | 10000111101110… |
… | …00110000001101 |
3 | 100220210022210202 |
4 | 20132320300031 |
5 | 242413031014 |
6 | 22042143245 |
7 | 3345440051 |
oct | 1036706015 |
9 | 326708722 |
10 | 142314509 |
11 | 73372aa7 |
12 | 3b7b1b25 |
13 | 2363a98c |
14 | 14c87c61 |
15 | c7623de |
hex | 87b8c0d |
142314509 has 2 divisors, whose sum is σ = 142314510. Its totient is φ = 142314508.
The previous prime is 142314493. The next prime is 142314511. The reversal of 142314509 is 905413241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81396484 + 60918025 = 9022^2 + 7805^2 .
It is a cyclic number.
It is not a de Polignac number, because 142314509 - 24 = 142314493 is a prime.
It is a super-2 number, since 2×1423145092 = 40506838943822162, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 142314511, it forms a pair of twin primes.
It is a Chen 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 (142314589) 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, 71157254 + 71157255.
It is an arithmetic number, because the mean of its divisors is an integer number (71157255).
Almost surely, 2142314509 is an apocalyptic number.
It is an amenable number.
142314509 is a deficient number, since it is larger than the sum of its proper divisors (1).
142314509 is an equidigital number, since it uses as much as digits as its factorization.
142314509 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 142314509 is about 11929.5644933082. The cubic root of 142314509 is about 522.0952310315.
The spelling of 142314509 in words is "one hundred forty-two million, three hundred fourteen thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •