Base | Representation |
---|---|
bin | 1101100000101001001… |
… | …1001000011000100101 |
3 | 211012002112000112011022 |
4 | 3120022103020120211 |
5 | 12300320330134341 |
6 | 254343054220525 |
7 | 22524452062106 |
oct | 3301223103045 |
9 | 735075015138 |
10 | 232101021221 |
11 | 8a484a80603 |
12 | 38b961b4745 |
13 | 18b6ba6bba4 |
14 | b33b5a03ad |
15 | 6086767e4b |
hex | 360a4c8625 |
232101021221 has 2 divisors, whose sum is σ = 232101021222. Its totient is φ = 232101021220.
The previous prime is 232101021211. The next prime is 232101021223. The reversal of 232101021221 is 122120101232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 204407068996 + 27693952225 = 452114^2 + 166415^2 .
It is a cyclic number.
It is not a de Polignac number, because 232101021221 - 230 = 231027279397 is a prime.
Together with 232101021223, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 232101021221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232101021223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116050510610 + 116050510611.
It is an arithmetic number, because the mean of its divisors is an integer number (116050510611).
Almost surely, 2232101021221 is an apocalyptic number.
It is an amenable number.
232101021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
232101021221 is an equidigital number, since it uses as much as digits as its factorization.
232101021221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 232101021221 its reverse (122120101232), we get a palindrome (354221122453).
The spelling of 232101021221 in words is "two hundred thirty-two billion, one hundred one million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •