Base | Representation |
---|---|
bin | 10000111001011… |
… | …100101000100101 |
3 | 201202110000221221 |
4 | 100321130220211 |
5 | 1040033314244 |
6 | 44044140341 |
7 | 10011444613 |
oct | 2071345045 |
9 | 652400857 |
10 | 283494949 |
11 | 136030a51 |
12 | 7ab376b1 |
13 | 4696c3ba |
14 | 299186b3 |
15 | 19d4d784 |
hex | 10e5ca25 |
283494949 has 2 divisors, whose sum is σ = 283494950. Its totient is φ = 283494948.
The previous prime is 283494943. The next prime is 283494961. The reversal of 283494949 is 949494382.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 266832225 + 16662724 = 16335^2 + 4082^2 .
It is a cyclic number.
It is not a de Polignac number, because 283494949 - 213 = 283486757 is a prime.
It is a super-2 number, since 2×2834949492 = 160738772217025202, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 283494896 and 283494905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (283494943) 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, 141747474 + 141747475.
It is an arithmetic number, because the mean of its divisors is an integer number (141747475).
Almost surely, 2283494949 is an apocalyptic number.
It is an amenable number.
283494949 is a deficient number, since it is larger than the sum of its proper divisors (1).
283494949 is an equidigital number, since it uses as much as digits as its factorization.
283494949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2239488, while the sum is 52.
The square root of 283494949 is about 16837.3082468665. The cubic root of 283494949 is about 656.9239695577.
The spelling of 283494949 in words is "two hundred eighty-three million, four hundred ninety-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •