Base | Representation |
---|---|
bin | 101110101111100111101010… |
… | …110111010010001011100011 |
3 | 222221220111111101022120121212 |
4 | 232233213222313102023203 |
5 | 203421231030243441341 |
6 | 2005123153013540335 |
7 | 61205564144246456 |
oct | 5657475267221343 |
9 | 887814441276555 |
10 | 205582549983971 |
11 | 5a561084a38056 |
12 | 1b0833380446ab |
13 | 8a934749b6174 |
14 | 38aa369cab49d |
15 | 18b7a196b35eb |
hex | baf9eadd22e3 |
205582549983971 has 2 divisors, whose sum is σ = 205582549983972. Its totient is φ = 205582549983970.
The previous prime is 205582549983953. The next prime is 205582549983983. The reversal of 205582549983971 is 179389945285502.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 205582549983971 - 242 = 201184503472867 is a prime.
It is a super-2 number, since 2×2055825499839712 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 205582549983892 and 205582549983901.
It is not a weakly prime, because it can be changed into another prime (205582549983911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102791274991985 + 102791274991986.
It is an arithmetic number, because the mean of its divisors is an integer number (102791274991986).
Almost surely, 2205582549983971 is an apocalyptic number.
205582549983971 is a deficient number, since it is larger than the sum of its proper divisors (1).
205582549983971 is an equidigital number, since it uses as much as digits as its factorization.
205582549983971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1959552000, while the sum is 77.
The spelling of 205582549983971 in words is "two hundred five trillion, five hundred eighty-two billion, five hundred forty-nine million, nine hundred eighty-three thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •