Base | Representation |
---|---|
bin | 110100110101000000111001… |
… | …110110000101010101010101 |
3 | 1010110122122002002210110120102 |
4 | 310311000321312011111111 |
5 | 220423140413424321344 |
6 | 2142052115452543445 |
7 | 66640056330613334 |
oct | 6465007166052525 |
9 | 1113578062713512 |
10 | 232341521323349 |
11 | 68038538724249 |
12 | 22085415481b85 |
13 | 9c84933090479 |
14 | 4153565223d1b |
15 | 1bcdb09848e4e |
hex | d35039d85555 |
232341521323349 has 2 divisors, whose sum is σ = 232341521323350. Its totient is φ = 232341521323348.
The previous prime is 232341521323319. The next prime is 232341521323357. The reversal of 232341521323349 is 943323125143232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 142661094822724 + 89680426500625 = 11944082^2 + 9469975^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232341521323349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232341521323319) 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, 116170760661674 + 116170760661675.
It is an arithmetic number, because the mean of its divisors is an integer number (116170760661675).
Almost surely, 2232341521323349 is an apocalyptic number.
It is an amenable number.
232341521323349 is a deficient number, since it is larger than the sum of its proper divisors (1).
232341521323349 is an equidigital number, since it uses as much as digits as its factorization.
232341521323349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2799360, while the sum is 47.
The spelling of 232341521323349 in words is "two hundred thirty-two trillion, three hundred forty-one billion, five hundred twenty-one million, three hundred twenty-three thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •