Base | Representation |
---|---|
bin | 1101010001101010100101 |
3 | 20112210222101 |
4 | 31101222211 |
5 | 1342331404 |
6 | 202332101 |
7 | 41403304 |
oct | 15215245 |
9 | 6483871 |
10 | 3480229 |
11 | 1a67825 |
12 | 11ba031 |
13 | 94b10c |
14 | 66843b |
15 | 48b2a4 |
hex | 351aa5 |
3480229 has 2 divisors, whose sum is σ = 3480230. Its totient is φ = 3480228.
The previous prime is 3480221. The next prime is 3480251. The reversal of 3480229 is 9220843.
3480229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3441025 + 39204 = 1855^2 + 198^2 .
It is a cyclic number.
It is not a de Polignac number, because 3480229 - 23 = 3480221 is a prime.
It is a super-2 number, since 2×34802292 = 24223987784882, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3480197 and 3480206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3480221) 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, 1740114 + 1740115.
It is an arithmetic number, because the mean of its divisors is an integer number (1740115).
Almost surely, 23480229 is an apocalyptic number.
It is an amenable number.
3480229 is a deficient number, since it is larger than the sum of its proper divisors (1).
3480229 is an equidigital number, since it uses as much as digits as its factorization.
3480229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 3480229 is about 1865.5371880507. The cubic root of 3480229 is about 151.5430209635.
The spelling of 3480229 in words is "three million, four hundred eighty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •