Base | Representation |
---|---|
bin | 10100011010100… |
… | …100111010001001 |
3 | 212212111101002112 |
4 | 110122210322021 |
5 | 1200140324431 |
6 | 53553112105 |
7 | 11326204022 |
oct | 2432447211 |
9 | 785441075 |
10 | 342511241 |
11 | 16637a846 |
12 | 96858635 |
13 | 55c63697 |
14 | 336bbc49 |
15 | 20109c2b |
hex | 146a4e89 |
342511241 has 2 divisors, whose sum is σ = 342511242. Its totient is φ = 342511240.
The previous prime is 342511207. The next prime is 342511243. The reversal of 342511241 is 142115243.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 337493641 + 5017600 = 18371^2 + 2240^2 .
It is a cyclic number.
It is not a de Polignac number, because 342511241 - 26 = 342511177 is a prime.
It is a super-2 number, since 2×3425112412 = 234627900422720162, which contains 22 as substring.
Together with 342511243, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (342511243) 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, 171255620 + 171255621.
It is an arithmetic number, because the mean of its divisors is an integer number (171255621).
Almost surely, 2342511241 is an apocalyptic number.
It is an amenable number.
342511241 is a deficient number, since it is larger than the sum of its proper divisors (1).
342511241 is an equidigital number, since it uses as much as digits as its factorization.
342511241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 960, while the sum is 23.
The square root of 342511241 is about 18507.0592207406. The cubic root of 342511241 is about 699.6673528321.
Adding to 342511241 its reverse (142115243), we get a palindrome (484626484).
The spelling of 342511241 in words is "three hundred forty-two million, five hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •