Base | Representation |
---|---|
bin | 1010000001010… |
… | …11111100000001 |
3 | 12212011222221101 |
4 | 11000223330001 |
5 | 133010103144 |
6 | 12201454401 |
7 | 2040356344 |
oct | 500537401 |
9 | 185158841 |
10 | 84066049 |
11 | 434a9081 |
12 | 241a1401 |
13 | 14555032 |
14 | b24445b |
15 | 75a86d4 |
hex | 502bf01 |
84066049 has 2 divisors, whose sum is σ = 84066050. Its totient is φ = 84066048.
The previous prime is 84066029. The next prime is 84066053. The reversal of 84066049 is 94066048.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74080449 + 9985600 = 8607^2 + 3160^2 .
It is a cyclic number.
It is not a de Polignac number, because 84066049 - 27 = 84065921 is a prime.
It is equal to p4892716 and since 84066049 and 4892716 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 84065999 and 84066017.
It is not a weakly prime, because it can be changed into another prime (84066019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 42033024 + 42033025.
It is an arithmetic number, because the mean of its divisors is an integer number (42033025).
Almost surely, 284066049 is an apocalyptic number.
It is an amenable number.
84066049 is a deficient number, since it is larger than the sum of its proper divisors (1).
84066049 is an equidigital number, since it uses as much as digits as its factorization.
84066049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 37.
The square root of 84066049 is about 9168.7539502377. The cubic root of 84066049 is about 438.0666707655.
Subtracting 84066049 from its reverse (94066048), we obtain a palindrome (9999999).
The spelling of 84066049 in words is "eighty-four million, sixty-six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •