Base | Representation |
---|---|
bin | 1100010111100011111001 |
3 | 20002201111201 |
4 | 30113203321 |
5 | 1312222413 |
6 | 153254201 |
7 | 36362401 |
oct | 14274371 |
9 | 6081451 |
10 | 3242233 |
11 | 1914a35 |
12 | 1104361 |
13 | 8969a7 |
14 | 605801 |
15 | 4409dd |
hex | 3178f9 |
3242233 has 4 divisors (see below), whose sum is σ = 3262288. Its totient is φ = 3222180.
The previous prime is 3242221. The next prime is 3242237. The reversal of 3242233 is 3322423.
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: 3322423 = 13 ⋅255571.
It is a cyclic number.
It is not a de Polignac number, because 3242233 - 213 = 3234041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3242233.
It is not an unprimeable number, because it can be changed into a prime (3242237) 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 in 3 ways as a sum of consecutive naturals, for example, 9783 + ... + 10108.
It is an arithmetic number, because the mean of its divisors is an integer number (815572).
Almost surely, 23242233 is an apocalyptic number.
It is an amenable number.
3242233 is a deficient number, since it is larger than the sum of its proper divisors (20055).
3242233 is a wasteful number, since it uses less digits than its factorization.
3242233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20054.
The product of its digits is 864, while the sum is 19.
The square root of 3242233 is about 1800.6201709411. The cubic root of 3242233 is about 148.0067107987.
Adding to 3242233 its reverse (3322423), we get a palindrome (6564656).
The spelling of 3242233 in words is "three million, two hundred forty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •