Base | Representation |
---|---|
bin | 1000011110110010010011 |
3 | 11011221201122 |
4 | 20132302103 |
5 | 1032121001 |
6 | 115352455 |
7 | 24616532 |
oct | 10366223 |
9 | 4157648 |
10 | 2223251 |
11 | 12893a8 |
12 | 8b272b |
13 | 5cac44 |
14 | 41c319 |
15 | 2ddb1b |
hex | 21ec93 |
2223251 has 4 divisors (see below), whose sum is σ = 2226312. Its totient is φ = 2220192.
The previous prime is 2223233. The next prime is 2223253. The reversal of 2223251 is 1523222.
2223251 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 brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1523222 = 2 ⋅761611.
It is a cyclic number.
It is not a de Polignac number, because 2223251 - 26 = 2223187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2223253) 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, 251 + ... + 2123.
It is an arithmetic number, because the mean of its divisors is an integer number (556578).
22223251 is an apocalyptic number.
2223251 is a deficient number, since it is larger than the sum of its proper divisors (3061).
2223251 is a wasteful number, since it uses less digits than its factorization.
2223251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3060.
The product of its digits is 240, while the sum is 17.
The square root of 2223251 is about 1491.0570076292. The cubic root of 2223251 is about 130.5157225763.
Adding to 2223251 its reverse (1523222), we get a palindrome (3746473).
The spelling of 2223251 in words is "two million, two hundred twenty-three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •