Base | Representation |
---|---|
bin | 1101010101100100100101 |
3 | 20120121220222 |
4 | 31111210211 |
5 | 1343334404 |
6 | 202534125 |
7 | 41501042 |
oct | 15254445 |
9 | 6517828 |
10 | 3496229 |
11 | 1a78850 |
12 | 1207345 |
13 | 955499 |
14 | 6701c9 |
15 | 490dbe |
hex | 355925 |
3496229 has 4 divisors (see below), whose sum is σ = 3814080. Its totient is φ = 3178380.
The previous prime is 3496223. The next prime is 3496249. The reversal of 3496229 is 9226943.
3496229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9226943 = 11 ⋅838813.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3496229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3496223) 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 in 3 ways as a sum of consecutive naturals, for example, 158909 + ... + 158930.
It is an arithmetic number, because the mean of its divisors is an integer number (953520).
Almost surely, 23496229 is an apocalyptic number.
It is an amenable number.
3496229 is a deficient number, since it is larger than the sum of its proper divisors (317851).
3496229 is a wasteful number, since it uses less digits than its factorization.
3496229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317850.
The product of its digits is 23328, while the sum is 35.
The square root of 3496229 is about 1869.8205796279. The cubic root of 3496229 is about 151.7749005366.
The spelling of 3496229 in words is "three million, four hundred ninety-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •