Base | Representation |
---|---|
bin | 1010000010110… |
… | …10010111100101 |
3 | 12212112122211002 |
4 | 11001122113211 |
5 | 133032144404 |
6 | 12205523045 |
7 | 2042110661 |
oct | 501322745 |
9 | 185478732 |
10 | 84256229 |
11 | 43618a52 |
12 | 24273485 |
13 | 145c0775 |
14 | b2938a1 |
15 | 75e4c1e |
hex | 505a5e5 |
84256229 has 2 divisors, whose sum is σ = 84256230. Its totient is φ = 84256228.
The previous prime is 84256217. The next prime is 84256231. The reversal of 84256229 is 92265248.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66422500 + 17833729 = 8150^2 + 4223^2 .
It is a cyclic number.
It is not a de Polignac number, because 84256229 - 24 = 84256213 is a prime.
It is a super-2 number, since 2×842562292 = 14198224250600882, which contains 22 as substring.
Together with 84256231, 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 = 84256192 and 84256201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (84256129) 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, 42128114 + 42128115.
It is an arithmetic number, because the mean of its divisors is an integer number (42128115).
Almost surely, 284256229 is an apocalyptic number.
It is an amenable number.
84256229 is a deficient number, since it is larger than the sum of its proper divisors (1).
84256229 is an equidigital number, since it uses as much as digits as its factorization.
84256229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69120, while the sum is 38.
The square root of 84256229 is about 9179.1191843226. The cubic root of 84256229 is about 438.3967634919.
The spelling of 84256229 in words is "eighty-four million, two hundred fifty-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •