Base | Representation |
---|---|
bin | 10000000000101011100100… |
… | …011000110100010011011001 |
3 | 100020022122210001021101101222 |
4 | 100000223210120310103121 |
5 | 33212141444020432221 |
6 | 405432240150221425 |
7 | 20555232236441645 |
oct | 2000534430642331 |
9 | 306278701241358 |
10 | 70415525561561 |
11 | 204890694a5734 |
12 | 7a93001054875 |
13 | 303a203a25b5b |
14 | 13561b5979c25 |
15 | 821a0941a9ab |
hex | 400ae46344d9 |
70415525561561 has 2 divisors, whose sum is σ = 70415525561562. Its totient is φ = 70415525561560.
The previous prime is 70415525561533. The next prime is 70415525561587. The reversal of 70415525561561 is 16516552551407.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66718919467225 + 3696606094336 = 8168165^2 + 1922656^2 .
It is an emirp because it is prime and its reverse (16516552551407) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 70415525561561 - 26 = 70415525561497 is a prime.
It is a super-2 number, since 2×704155255615612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (70415525561261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35207762780780 + 35207762780781.
It is an arithmetic number, because the mean of its divisors is an integer number (35207762780781).
Almost surely, 270415525561561 is an apocalyptic number.
It is an amenable number.
70415525561561 is a deficient number, since it is larger than the sum of its proper divisors (1).
70415525561561 is an equidigital number, since it uses as much as digits as its factorization.
70415525561561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6300000, while the sum is 53.
The spelling of 70415525561561 in words is "seventy trillion, four hundred fifteen billion, five hundred twenty-five million, five hundred sixty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •