Base | Representation |
---|---|
bin | 11110110000000110100… |
… | …00101100110111110001 |
3 | 10202000022102122222112022 |
4 | 33120003100230313301 |
5 | 114302422331231221 |
6 | 2125223014041225 |
7 | 136223642314013 |
oct | 17300320546761 |
9 | 3660272588468 |
10 | 1056616664561 |
11 | 378121619a67 |
12 | 150942949215 |
13 | 7883bab60a3 |
14 | 391d782a1b3 |
15 | 1c741e544ab |
hex | f60342cdf1 |
1056616664561 has 2 divisors, whose sum is σ = 1056616664562. Its totient is φ = 1056616664560.
The previous prime is 1056616664533. The next prime is 1056616664569. The reversal of 1056616664561 is 1654666166501.
1056616664561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 925384356961 + 131232307600 = 961969^2 + 362260^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1056616664561 is a prime.
It is a super-2 number, since 2×10566166645612 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1056616664569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528308332280 + 528308332281.
It is an arithmetic number, because the mean of its divisors is an integer number (528308332281).
Almost surely, 21056616664561 is an apocalyptic number.
It is an amenable number.
1056616664561 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056616664561 is an equidigital number, since it uses as much as digits as its factorization.
1056616664561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4665600, while the sum is 53.
The spelling of 1056616664561 in words is "one trillion, fifty-six billion, six hundred sixteen million, six hundred sixty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •