Base | Representation |
---|---|
bin | 111111110101111110110111… |
… | …1000000111001110100000001 |
3 | 2201122100212102002021201101101 |
4 | 1333223331233000321310001 |
5 | 1042101303233121131243 |
6 | 5310211045102134401 |
7 | 226200214464540463 |
oct | 17753755700716401 |
9 | 2648325362251341 |
10 | 561573131427073 |
11 | 152a30911566897 |
12 | 52b98775581401 |
13 | 1b14717178283c |
14 | 9c963dac90133 |
15 | 44dcc14d1154d |
hex | 1febf6f039d01 |
561573131427073 has 2 divisors, whose sum is σ = 561573131427074. Its totient is φ = 561573131427072.
The previous prime is 561573131427053. The next prime is 561573131427089. The reversal of 561573131427073 is 370724131375165.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 417878920915569 + 143694210511504 = 20442087^2 + 11987252^2 .
It is a cyclic number.
It is not a de Polignac number, because 561573131427073 - 241 = 559374108171521 is a prime.
It is not a weakly prime, because it can be changed into another prime (561573131427013) 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, 280786565713536 + 280786565713537.
It is an arithmetic number, because the mean of its divisors is an integer number (280786565713537).
Almost surely, 2561573131427073 is an apocalyptic number.
It is an amenable number.
561573131427073 is a deficient number, since it is larger than the sum of its proper divisors (1).
561573131427073 is an equidigital number, since it uses as much as digits as its factorization.
561573131427073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11113200, while the sum is 55.
The spelling of 561573131427073 in words is "five hundred sixty-one trillion, five hundred seventy-three billion, one hundred thirty-one million, four hundred twenty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •