Base | Representation |
---|---|
bin | 1101100000101001111… |
… | …1110101010111110101 |
3 | 211012002202021201001122 |
4 | 3120022133311113311 |
5 | 12300322203214341 |
6 | 254343253433325 |
7 | 22524522301421 |
oct | 3301237652765 |
9 | 735082251048 |
10 | 232104351221 |
11 | 8a486945476 |
12 | 38b9733b845 |
13 | 18b6c6667c2 |
14 | b33bbc9b81 |
15 | 6086bc494b |
hex | 360a7f55f5 |
232104351221 has 2 divisors, whose sum is σ = 232104351222. Its totient is φ = 232104351220.
The previous prime is 232104351161. The next prime is 232104351223. The reversal of 232104351221 is 122153401232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195531996100 + 36572355121 = 442190^2 + 191239^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232104351221 is a prime.
Together with 232104351223, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232104351223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116052175610 + 116052175611.
It is an arithmetic number, because the mean of its divisors is an integer number (116052175611).
Almost surely, 2232104351221 is an apocalyptic number.
It is an amenable number.
232104351221 is a deficient number, since it is larger than the sum of its proper divisors (1).
232104351221 is an equidigital number, since it uses as much as digits as its factorization.
232104351221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 232104351221 its reverse (122153401232), we get a palindrome (354257752453).
The spelling of 232104351221 in words is "two hundred thirty-two billion, one hundred four million, three hundred fifty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •