Base | Representation |
---|---|
bin | 10100011001000… |
… | …001000111111001 |
3 | 212211201121102202 |
4 | 110121001013321 |
5 | 1200034240041 |
6 | 53540235545 |
7 | 11322552305 |
oct | 2431010771 |
9 | 784647382 |
10 | 342102521 |
11 | 166120762 |
12 | 9669bbb5 |
13 | 55b4c637 |
14 | 33612d05 |
15 | 20078a9b |
hex | 146411f9 |
342102521 has 2 divisors, whose sum is σ = 342102522. Its totient is φ = 342102520.
The previous prime is 342102503. The next prime is 342102547. The reversal of 342102521 is 125201243.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 318444025 + 23658496 = 17845^2 + 4864^2 .
It is a cyclic number.
It is not a de Polignac number, because 342102521 - 218 = 341840377 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 342102493 and 342102502.
It is not a weakly prime, because it can be changed into another prime (342102571) 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, 171051260 + 171051261.
It is an arithmetic number, because the mean of its divisors is an integer number (171051261).
Almost surely, 2342102521 is an apocalyptic number.
It is an amenable number.
342102521 is a deficient number, since it is larger than the sum of its proper divisors (1).
342102521 is an equidigital number, since it uses as much as digits as its factorization.
342102521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 342102521 is about 18496.0136515953. The cubic root of 342102521 is about 699.3889367972.
Adding to 342102521 its reverse (125201243), we get a palindrome (467303764).
The spelling of 342102521 in words is "three hundred forty-two million, one hundred two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •