Base | Representation |
---|---|
bin | 1010000000011… |
… | …10110101110101 |
3 | 12211221221110022 |
4 | 11000032311311 |
5 | 132442244434 |
6 | 12155134525 |
7 | 2036352026 |
oct | 500166565 |
9 | 184857408 |
10 | 83946869 |
11 | 43427586 |
12 | 24144445 |
13 | 14512a06 |
14 | b212c4d |
15 | 758322e |
hex | 500ed75 |
83946869 has 2 divisors, whose sum is σ = 83946870. Its totient is φ = 83946868.
The previous prime is 83946839. The next prime is 83946881. The reversal of 83946869 is 96864938.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83631025 + 315844 = 9145^2 + 562^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-83946869 is a prime.
It is a super-2 number, since 2×839468692 = 14094153629806322, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 83946869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (83946809) 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, 41973434 + 41973435.
It is an arithmetic number, because the mean of its divisors is an integer number (41973435).
Almost surely, 283946869 is an apocalyptic number.
It is an amenable number.
83946869 is a deficient number, since it is larger than the sum of its proper divisors (1).
83946869 is an equidigital number, since it uses as much as digits as its factorization.
83946869 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2239488, while the sum is 53.
The square root of 83946869 is about 9162.2523977459. The cubic root of 83946869 is about 437.8595579142.
The spelling of 83946869 in words is "eighty-three million, nine hundred forty-six thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •