Base | Representation |
---|---|
bin | 1000100001000101111101 |
3 | 11012102200122 |
4 | 20201011331 |
5 | 1032421301 |
6 | 115504325 |
7 | 24656222 |
oct | 10410575 |
9 | 4172618 |
10 | 2232701 |
11 | 1295509 |
12 | 8b80a5 |
13 | 602333 |
14 | 421949 |
15 | 2e181b |
hex | 22117d |
2232701 has 2 divisors, whose sum is σ = 2232702. Its totient is φ = 2232700.
The previous prime is 2232677. The next prime is 2232749. The reversal of 2232701 is 1072322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2172676 + 60025 = 1474^2 + 245^2 .
It is a cyclic number.
It is not a de Polignac number, because 2232701 - 214 = 2216317 is a prime.
It is a super-3 number, since 3×22327013 = 33389733703912704303, which contains 333 as substring.
It is a Chen prime.
It is a d-powerful number, because it can be written as 211 + 217 + 33 + 221 + 74 + 0 + 1 .
It is a self number, because there is not a number n which added to its sum of digits gives 2232701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2232751) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1116350 + 1116351.
It is an arithmetic number, because the mean of its divisors is an integer number (1116351).
22232701 is an apocalyptic number.
It is an amenable number.
2232701 is a deficient number, since it is larger than the sum of its proper divisors (1).
2232701 is an equidigital number, since it uses as much as digits as its factorization.
2232701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 17.
The square root of 2232701 is about 1494.2225403199. Note that the first 3 decimals coincide. The cubic root of 2232701 is about 130.7003816177.
It can be divided in two parts, 22 and 32701, that added together give a palindrome (32723).
The spelling of 2232701 in words is "two million, two hundred thirty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •