Base | Representation |
---|---|
bin | 1101001111010110010101 |
3 | 20112022221222 |
4 | 31033112111 |
5 | 1342030431 |
6 | 202220125 |
7 | 41333531 |
oct | 15172625 |
9 | 6468858 |
10 | 3470741 |
11 | 1a6068a |
12 | 11b4645 |
13 | 9469c1 |
14 | 664bc1 |
15 | 48857b |
hex | 34f595 |
3470741 has 2 divisors, whose sum is σ = 3470742. Its totient is φ = 3470740.
The previous prime is 3470713. The next prime is 3470743. The reversal of 3470741 is 1470743.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1918225 + 1552516 = 1385^2 + 1246^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3470741 is a prime.
It is a Sophie Germain prime.
Together with 3470743, 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 self number, because there is not a number n which added to its sum of digits gives 3470741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3470743) 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, 1735370 + 1735371.
It is an arithmetic number, because the mean of its divisors is an integer number (1735371).
Almost surely, 23470741 is an apocalyptic number.
It is an amenable number.
3470741 is a deficient number, since it is larger than the sum of its proper divisors (1).
3470741 is an equidigital number, since it uses as much as digits as its factorization.
3470741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 26.
The square root of 3470741 is about 1862.9924852237. The cubic root of 3470741 is about 151.4051805315.
The spelling of 3470741 in words is "three million, four hundred seventy thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •