Base | Representation |
---|---|
bin | 10000001011111001011… |
… | …00100000111001111001 |
3 | 1222011111112211201201102 |
4 | 20011330230200321321 |
5 | 33102440030400311 |
6 | 1103253302501145 |
7 | 55115511005204 |
oct | 10057454407171 |
9 | 1864445751642 |
10 | 556142825081 |
11 | 1a494a142998 |
12 | 8b94b1347b5 |
13 | 405a074272c |
14 | 1ccbb70093b |
15 | e6ee92443b |
hex | 817cb20e79 |
556142825081 has 2 divisors, whose sum is σ = 556142825082. Its totient is φ = 556142825080.
The previous prime is 556142825039. The next prime is 556142825083. The reversal of 556142825081 is 180528241655.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 392607509056 + 163535316025 = 626584^2 + 404395^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-556142825081 is a prime.
It is a super-2 number, since 2×5561428250812 (a number of 24 digits) contains 22 as substring.
Together with 556142825083, 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 (556142825083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278071412540 + 278071412541.
It is an arithmetic number, because the mean of its divisors is an integer number (278071412541).
Almost surely, 2556142825081 is an apocalyptic number.
It is an amenable number.
556142825081 is a deficient number, since it is larger than the sum of its proper divisors (1).
556142825081 is an equidigital number, since it uses as much as digits as its factorization.
556142825081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768000, while the sum is 47.
The spelling of 556142825081 in words is "five hundred fifty-six billion, one hundred forty-two million, eight hundred twenty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •