Base | Representation |
---|---|
bin | 10000110000001110… |
… | …00000110011001011 |
3 | 212012211121012000002 |
4 | 20120013000303023 |
5 | 121410033113214 |
6 | 4044301433215 |
7 | 435614234333 |
oct | 103007006313 |
9 | 25184535002 |
10 | 8994426059 |
11 | 38a6134473 |
12 | 18b026b80b |
13 | b0457b1c8 |
14 | 6147a40c3 |
15 | 37997a1de |
hex | 2181c0ccb |
8994426059 has 2 divisors, whose sum is σ = 8994426060. Its totient is φ = 8994426058.
The previous prime is 8994426043. The next prime is 8994426061. The reversal of 8994426059 is 9506244998.
It is a happy number.
8994426059 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 8994426059 - 24 = 8994426043 is a prime.
Together with 8994426061, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 8994425995 and 8994426013.
It is not a weakly prime, because it can be changed into another prime (8994426019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4497213029 + 4497213030.
It is an arithmetic number, because the mean of its divisors is an integer number (4497213030).
Almost surely, 28994426059 is an apocalyptic number.
8994426059 is a deficient number, since it is larger than the sum of its proper divisors (1).
8994426059 is an equidigital number, since it uses as much as digits as its factorization.
8994426059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 56.
The square root of 8994426059 is about 94838.9480066075. The cubic root of 8994426059 is about 2079.6543171677.
The spelling of 8994426059 in words is "eight billion, nine hundred ninety-four million, four hundred twenty-six thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •