Base | Representation |
---|---|
bin | 1010110000110… |
… | …01111000110001 |
3 | 20021212212202220 |
4 | 11120121320301 |
5 | 141103033234 |
6 | 12543031253 |
7 | 2144253255 |
oct | 530317061 |
9 | 207785686 |
10 | 90283569 |
11 | 46a65422 |
12 | 2629b529 |
13 | 1592103c |
14 | bdc2265 |
15 | 7dd5a49 |
hex | 5619e31 |
90283569 has 16 divisors (see below), whose sum is σ = 123275520. Its totient is φ = 58747520.
The previous prime is 90283561. The next prime is 90283577. The reversal of 90283569 is 96538209.
It is an interprime number because it is at equal distance from previous prime (90283561) and next prime (90283577).
It is a cyclic number.
It is not a de Polignac number, because 90283569 - 23 = 90283561 is a prime.
It is a super-2 number, since 2×902835692 = 16302245662755522, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 90283569.
It is not an unprimeable number, because it can be changed into a prime (90283561) 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 in 15 ways as a sum of consecutive naturals, for example, 72847 + ... + 74075.
It is an arithmetic number, because the mean of its divisors is an integer number (7704720).
Almost surely, 290283569 is an apocalyptic number.
It is an amenable number.
90283569 is a deficient number, since it is larger than the sum of its proper divisors (32991951).
90283569 is a wasteful number, since it uses less digits than its factorization.
90283569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1800.
The product of its (nonzero) digits is 116640, while the sum is 42.
The square root of 90283569 is about 9501.7666252124. The cubic root of 90283569 is about 448.6106432269.
The spelling of 90283569 in words is "ninety million, two hundred eighty-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •