Base | Representation |
---|---|
bin | 1000101000011111011001 |
3 | 11020222020212 |
4 | 20220133121 |
5 | 1034404001 |
6 | 120300505 |
7 | 25143446 |
oct | 10503731 |
9 | 4228225 |
10 | 2263001 |
11 | 1306254 |
12 | 911735 |
13 | 613070 |
14 | 42c9cd |
15 | 2ea7bb |
hex | 2287d9 |
2263001 has 4 divisors (see below), whose sum is σ = 2437092. Its totient is φ = 2088912.
The previous prime is 2262979. The next prime is 2263007. The reversal of 2263001 is 1003622.
2263001 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.
It can be written as a sum of positive squares in 2 ways, for example, as 235225 + 2027776 = 485^2 + 1424^2 .
It is a cyclic number.
It is not a de Polignac number, because 2263001 - 26 = 2262937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2263007) 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, 87026 + ... + 87051.
It is an arithmetic number, because the mean of its divisors is an integer number (609273).
22263001 is an apocalyptic number.
It is an amenable number.
2263001 is a deficient number, since it is larger than the sum of its proper divisors (174091).
2263001 is a wasteful number, since it uses less digits than its factorization.
2263001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174090.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2263001 is about 1504.3274244658. The cubic root of 2263001 is about 131.2889722514.
Adding to 2263001 its reverse (1003622), we get a palindrome (3266623).
The spelling of 2263001 in words is "two million, two hundred sixty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •