Base | Representation |
---|---|
bin | 110101100010… |
… | …0011011110001 |
3 | 1221210222110121 |
4 | 1223010123301 |
5 | 24141130234 |
6 | 2441330241 |
7 | 460366435 |
oct | 153043361 |
9 | 57728417 |
10 | 28067569 |
11 | 14930642 |
12 | 9496981 |
13 | 5a7953a |
14 | 3a289c5 |
15 | 26e64b4 |
hex | 1ac46f1 |
28067569 has 4 divisors (see below), whose sum is σ = 28129444. Its totient is φ = 28005696.
The previous prime is 28067537. The next prime is 28067587. The reversal of 28067569 is 96576082.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17098225 + 10969344 = 4135^2 + 3312^2 .
It is a cyclic number.
It is not a de Polignac number, because 28067569 - 25 = 28067537 is a prime.
It is a super-3 number, since 3×280675693 (a number of 23 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28067069) 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 3 ways as a sum of consecutive naturals, for example, 30252 + ... + 31165.
It is an arithmetic number, because the mean of its divisors is an integer number (7032361).
Almost surely, 228067569 is an apocalyptic number.
It is an amenable number.
28067569 is a deficient number, since it is larger than the sum of its proper divisors (61875).
28067569 is an equidigital number, since it uses as much as digits as its factorization.
28067569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61874.
The product of its (nonzero) digits is 181440, while the sum is 43.
The square root of 28067569 is about 5297.8834453015. The cubic root of 28067569 is about 303.9029620166.
The spelling of 28067569 in words is "twenty-eight million, sixty-seven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •