Base | Representation |
---|---|
bin | 110101111001… |
… | …1011001111101 |
3 | 1222011202101101 |
4 | 1223303121331 |
5 | 24213304330 |
6 | 2445413101 |
7 | 462130366 |
oct | 153633175 |
9 | 58152341 |
10 | 28259965 |
11 | 14a52148 |
12 | 956a191 |
13 | 5b15c96 |
14 | 3a78b6d |
15 | 27334ca |
hex | 1af367d |
28259965 has 8 divisors (see below), whose sum is σ = 33951960. Its totient is φ = 22581312.
The previous prime is 28259953. The next prime is 28259969. The reversal of 28259965 is 56995282.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 4024036 + 24235929 = 2006^2 + 4923^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28259965 - 215 = 28227197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28259969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2151 + ... + 7819.
It is an arithmetic number, because the mean of its divisors is an integer number (4243995).
Almost surely, 228259965 is an apocalyptic number.
It is an amenable number.
28259965 is a deficient number, since it is larger than the sum of its proper divisors (5691995).
28259965 is an equidigital number, since it uses as much as digits as its factorization.
28259965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6671.
The product of its digits is 388800, while the sum is 46.
The square root of 28259965 is about 5316.0102520593. The cubic root of 28259965 is about 304.5957737385.
It can be divided in two parts, 28 and 259965, that multiplied together give a triangular number (7279020 = T3815).
The spelling of 28259965 in words is "twenty-eight million, two hundred fifty-nine thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •