Base | Representation |
---|---|
bin | 1110101010011101001100… |
… | …11101011101010110101101 |
3 | 11020011121021022110002110121 |
4 | 13111032212131131112231 |
5 | 13211300442212400331 |
6 | 152325111114004541 |
7 | 6535426640443522 |
oct | 725164635352655 |
9 | 136147238402417 |
10 | 32245112231341 |
11 | a302091254159 |
12 | 374939aa16751 |
13 | 14cb91623a7a9 |
14 | 7d6959443149 |
15 | 3adb81937c11 |
hex | 1d53a675d5ad |
32245112231341 has 2 divisors, whose sum is σ = 32245112231342. Its totient is φ = 32245112231340.
The previous prime is 32245112231333. The next prime is 32245112231351. The reversal of 32245112231341 is 14313221154223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30301446855625 + 1943665375716 = 5504675^2 + 1394154^2 .
It is a cyclic number.
It is not a de Polignac number, because 32245112231341 - 23 = 32245112231333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32245112231297 and 32245112231306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32245112231351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16122556115670 + 16122556115671.
It is an arithmetic number, because the mean of its divisors is an integer number (16122556115671).
Almost surely, 232245112231341 is an apocalyptic number.
It is an amenable number.
32245112231341 is a deficient number, since it is larger than the sum of its proper divisors (1).
32245112231341 is an equidigital number, since it uses as much as digits as its factorization.
32245112231341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 34.
Adding to 32245112231341 its reverse (14313221154223), we get a palindrome (46558333385564).
The spelling of 32245112231341 in words is "thirty-two trillion, two hundred forty-five billion, one hundred twelve million, two hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •