Base | Representation |
---|---|
bin | 1111101110011110… |
… | …11101111110000001 |
3 | 210210101222120012021 |
4 | 13313033131332001 |
5 | 114242401311221 |
6 | 3513442401441 |
7 | 416140161331 |
oct | 76717357601 |
9 | 23711876167 |
10 | 8442994561 |
11 | 3642939861 |
12 | 1777660281 |
13 | a47259291 |
14 | 5a14610c1 |
15 | 346353041 |
hex | 1f73ddf81 |
8442994561 has 2 divisors, whose sum is σ = 8442994562. Its totient is φ = 8442994560.
The previous prime is 8442994559. The next prime is 8442994613. The reversal of 8442994561 is 1654992448.
It is an a-pointer prime, because the next prime (8442994613) can be obtained adding 8442994561 to its sum of digits (52).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4350193936 + 4092800625 = 65956^2 + 63975^2 .
It is a cyclic number.
It is not a de Polignac number, because 8442994561 - 21 = 8442994559 is a prime.
Together with 8442994559, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 8442994499 and 8442994508.
It is not a weakly prime, because it can be changed into another prime (8442994501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4221497280 + 4221497281.
It is an arithmetic number, because the mean of its divisors is an integer number (4221497281).
Almost surely, 28442994561 is an apocalyptic number.
It is an amenable number.
8442994561 is a deficient number, since it is larger than the sum of its proper divisors (1).
8442994561 is an equidigital number, since it uses as much as digits as its factorization.
8442994561 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2488320, while the sum is 52.
The square root of 8442994561 is about 91885.7690885808. The cubic root of 8442994561 is about 2036.2550286495.
The spelling of 8442994561 in words is "eight billion, four hundred forty-two million, nine hundred ninety-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •