Base | Representation |
---|---|
bin | 111010000011011011010001… |
… | …101001101100110001101101 |
3 | 1020111000120002011020222221012 |
4 | 322003123101221230301231 |
5 | 231431144222132404334 |
6 | 2303005212351115005 |
7 | 104531262504156314 |
oct | 7203332151546155 |
9 | 1214016064228835 |
10 | 255322143247469 |
11 | 743985706a0811 |
12 | 24777185212a65 |
13 | ac60a0c3001bc |
14 | 470992c90527b |
15 | 1e7b7acaa69ce |
hex | e836d1a6cc6d |
255322143247469 has 2 divisors, whose sum is σ = 255322143247470. Its totient is φ = 255322143247468.
The previous prime is 255322143247411. The next prime is 255322143247511. The reversal of 255322143247469 is 964742341223552.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 160279727186569 + 95042416060900 = 12660163^2 + 9748970^2 .
It is a cyclic number.
It is not a de Polignac number, because 255322143247469 - 236 = 255253423770733 is a prime.
It is a super-2 number, since 2×2553221432474692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (255322143247169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127661071623734 + 127661071623735.
It is an arithmetic number, because the mean of its divisors is an integer number (127661071623735).
Almost surely, 2255322143247469 is an apocalyptic number.
It is an amenable number.
255322143247469 is a deficient number, since it is larger than the sum of its proper divisors (1).
255322143247469 is an equidigital number, since it uses as much as digits as its factorization.
255322143247469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 87091200, while the sum is 59.
The spelling of 255322143247469 in words is "two hundred fifty-five trillion, three hundred twenty-two billion, one hundred forty-three million, two hundred forty-seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •