Base | Representation |
---|---|
bin | 10000010110100001100… |
… | …01000111101010011001 |
3 | 1222201020011200011112012 |
4 | 20023100301013222121 |
5 | 33201131130121344 |
6 | 1110035354355305 |
7 | 55410060426464 |
oct | 10132061075231 |
9 | 1881204604465 |
10 | 561848285849 |
11 | 1a730778a024 |
12 | 90a81a2bb35 |
13 | 40c9c7a3116 |
14 | 1d29d35c2db |
15 | e93577b29e |
hex | 82d0c47a99 |
561848285849 has 2 divisors, whose sum is σ = 561848285850. Its totient is φ = 561848285848.
The previous prime is 561848285833. The next prime is 561848285851. The reversal of 561848285849 is 948582848165.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 556169909824 + 5678376025 = 745768^2 + 75355^2 .
It is a cyclic number.
It is not a de Polignac number, because 561848285849 - 24 = 561848285833 is a prime.
It is a super-2 number, since 2×5618482858492 (a number of 24 digits) contains 22 as substring.
Together with 561848285851, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (561848285819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 280924142924 + 280924142925.
It is an arithmetic number, because the mean of its divisors is an integer number (280924142925).
Almost surely, 2561848285849 is an apocalyptic number.
It is an amenable number.
561848285849 is a deficient number, since it is larger than the sum of its proper divisors (1).
561848285849 is an equidigital number, since it uses as much as digits as its factorization.
561848285849 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 176947200, while the sum is 68.
The spelling of 561848285849 in words is "five hundred sixty-one billion, eight hundred forty-eight million, two hundred eighty-five thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •