Base | Representation |
---|---|
bin | 101111101111100010111111… |
… | …011100011101101001000111 |
3 | 1000112110110122201022000211022 |
4 | 233233202333130131221013 |
5 | 210010214433201422201 |
6 | 2022325240244501355 |
7 | 62141143305363632 |
oct | 5757427734355107 |
9 | 1015413581260738 |
10 | 209975573076551 |
11 | 609a515aa4a227 |
12 | 1b67280a6aa85b |
13 | 90217c4840c39 |
14 | 39bcc2c944c19 |
15 | 1941e2e7b041b |
hex | bef8bf71da47 |
209975573076551 has 2 divisors, whose sum is σ = 209975573076552. Its totient is φ = 209975573076550.
The previous prime is 209975573076541. The next prime is 209975573076553. The reversal of 209975573076551 is 155670375579902.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 209975573076551 - 214 = 209975573060167 is a prime.
It is a super-4 number, since 4×2099755730765514 (a number of 58 digits) contains 4444 as substring.
Together with 209975573076553, 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 (209975573076553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 104987786538275 + 104987786538276.
It is an arithmetic number, because the mean of its divisors is an integer number (104987786538276).
Almost surely, 2209975573076551 is an apocalyptic number.
209975573076551 is a deficient number, since it is larger than the sum of its proper divisors (1).
209975573076551 is an equidigital number, since it uses as much as digits as its factorization.
209975573076551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 625117500, while the sum is 71.
The spelling of 209975573076551 in words is "two hundred nine trillion, nine hundred seventy-five billion, five hundred seventy-three million, seventy-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •