Base | Representation |
---|---|
bin | 1101010000101010101101 |
3 | 20112121100222 |
4 | 31100222231 |
5 | 1342214031 |
6 | 202301125 |
7 | 41355344 |
oct | 15205255 |
9 | 6477328 |
10 | 3476141 |
11 | 1a64749 |
12 | 11b77a5 |
13 | 9492b6 |
14 | 666b5b |
15 | 489e7b |
hex | 350aad |
3476141 has 2 divisors, whose sum is σ = 3476142. Its totient is φ = 3476140.
The previous prime is 3476131. The next prime is 3476149. The reversal of 3476141 is 1416743.
3476141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2788900 + 687241 = 1670^2 + 829^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3476141 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a self number, because there is not a number n which added to its sum of digits gives 3476141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3476149) 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, 1738070 + 1738071.
It is an arithmetic number, because the mean of its divisors is an integer number (1738071).
Almost surely, 23476141 is an apocalyptic number.
It is an amenable number.
3476141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3476141 is an equidigital number, since it uses as much as digits as its factorization.
3476141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2016, while the sum is 26.
The square root of 3476141 is about 1864.4412031491. The cubic root of 3476141 is about 151.4836617860.
The spelling of 3476141 in words is "three million, four hundred seventy-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •