Base | Representation |
---|---|
bin | 11011110000010… |
… | …00110111111101 |
3 | 121020002111022011 |
4 | 31320020313331 |
5 | 434100221341 |
6 | 35034051221 |
7 | 5524640104 |
oct | 1570106775 |
9 | 536074264 |
10 | 232820221 |
11 | 10a46a307 |
12 | 65b79b11 |
13 | 39308b5a |
14 | 22cc703b |
15 | 1568db81 |
hex | de08dfd |
232820221 has 2 divisors, whose sum is σ = 232820222. Its totient is φ = 232820220.
The previous prime is 232820201. The next prime is 232820233. The reversal of 232820221 is 122028232.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 227708100 + 5112121 = 15090^2 + 2261^2 .
It is a cyclic number.
It is not a de Polignac number, because 232820221 - 215 = 232787453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232820192 and 232820201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232820201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116410110 + 116410111.
It is an arithmetic number, because the mean of its divisors is an integer number (116410111).
Almost surely, 2232820221 is an apocalyptic number.
It is an amenable number.
232820221 is a deficient number, since it is larger than the sum of its proper divisors (1).
232820221 is an equidigital number, since it uses as much as digits as its factorization.
232820221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 232820221 is about 15258.4475291558. The cubic root of 232820221 is about 615.1866452687.
Adding to 232820221 its reverse (122028232), we get a palindrome (354848453).
The spelling of 232820221 in words is "two hundred thirty-two million, eight hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •