Base | Representation |
---|---|
bin | 10000110111110… |
… | …001011001000001 |
3 | 201201121201101202 |
4 | 100313301121001 |
5 | 1034430240211 |
6 | 44030510545 |
7 | 10004635136 |
oct | 2067613101 |
9 | 651551352 |
10 | 283055681 |
11 | 135860a17 |
12 | 7a965455 |
13 | 4684748c |
14 | 2984258d |
15 | 19cb353b |
hex | 10df1641 |
283055681 has 2 divisors, whose sum is σ = 283055682. Its totient is φ = 283055680.
The previous prime is 283055659. The next prime is 283055719. The reversal of 283055681 is 186550382.
It is an a-pointer prime, because the next prime (283055719) can be obtained adding 283055681 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 278890000 + 4165681 = 16700^2 + 2041^2 .
It is a cyclic number.
It is not a de Polignac number, because 283055681 - 210 = 283054657 is a prime.
It is a super-2 number, since 2×2830556812 = 160241037092747522, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (283055081) 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, 141527840 + 141527841.
It is an arithmetic number, because the mean of its divisors is an integer number (141527841).
Almost surely, 2283055681 is an apocalyptic number.
It is an amenable number.
283055681 is a deficient number, since it is larger than the sum of its proper divisors (1).
283055681 is an equidigital number, since it uses as much as digits as its factorization.
283055681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 38.
The square root of 283055681 is about 16824.2587058093. The cubic root of 283055681 is about 656.5844986672.
The spelling of 283055681 in words is "two hundred eighty-three million, fifty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •