Base | Representation |
---|---|
bin | 10100100110101… |
… | …000001110001101 |
3 | 220002102212211122 |
4 | 110212220032031 |
5 | 1201442424131 |
6 | 54144530325 |
7 | 11365102556 |
oct | 2446501615 |
9 | 802385748 |
10 | 345670541 |
11 | 168138437 |
12 | 979209a5 |
13 | 567cb6a8 |
14 | 33ca132d |
15 | 20530d7b |
hex | 149a838d |
345670541 has 2 divisors, whose sum is σ = 345670542. Its totient is φ = 345670540.
The previous prime is 345670513. The next prime is 345670543. The reversal of 345670541 is 145076543.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 244265641 + 101404900 = 15629^2 + 10070^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-345670541 is a prime.
It is a Sophie Germain prime.
Together with 345670543, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (345670543) 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, 172835270 + 172835271.
It is an arithmetic number, because the mean of its divisors is an integer number (172835271).
Almost surely, 2345670541 is an apocalyptic number.
It is an amenable number.
345670541 is a deficient number, since it is larger than the sum of its proper divisors (1).
345670541 is an equidigital number, since it uses as much as digits as its factorization.
345670541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 35.
The square root of 345670541 is about 18592.2172158137. The cubic root of 345670541 is about 701.8120000191.
The spelling of 345670541 in words is "three hundred forty-five million, six hundred seventy thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •