Base | Representation |
---|---|
bin | 10100011011000… |
… | …000010100110001 |
3 | 212212201002010122 |
4 | 110123000110301 |
5 | 1200202423122 |
6 | 53555340025 |
7 | 11330152304 |
oct | 2433002461 |
9 | 785632118 |
10 | 342623537 |
11 | 166447153 |
12 | 968b1615 |
13 | 55ca2829 |
14 | 3370ab3b |
15 | 2012d142 |
hex | 146c0531 |
342623537 has 2 divisors, whose sum is σ = 342623538. Its totient is φ = 342623536.
The previous prime is 342623507. The next prime is 342623539. The reversal of 342623537 is 735326243.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 337236496 + 5387041 = 18364^2 + 2321^2 .
It is an emirp because it is prime and its reverse (735326243) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 342623537 - 216 = 342558001 is a prime.
Together with 342623539, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 342623497 and 342623506.
It is not a weakly prime, because it can be changed into another prime (342623539) 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, 171311768 + 171311769.
It is an arithmetic number, because the mean of its divisors is an integer number (171311769).
Almost surely, 2342623537 is an apocalyptic number.
It is an amenable number.
342623537 is a deficient number, since it is larger than the sum of its proper divisors (1).
342623537 is an equidigital number, since it uses as much as digits as its factorization.
342623537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 90720, while the sum is 35.
The square root of 342623537 is about 18510.0928414744. The cubic root of 342623537 is about 699.7438089699.
The spelling of 342623537 in words is "three hundred forty-two million, six hundred twenty-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •