Base | Representation |
---|---|
bin | 110111010000… |
… | …0000111101101 |
3 | 2000111200210212 |
4 | 1232200013231 |
5 | 24403424110 |
6 | 2512512205 |
7 | 501135035 |
oct | 156400755 |
9 | 60450725 |
10 | 28967405 |
11 | 15395705 |
12 | 984b665 |
13 | 6002c9c |
14 | 3bc08c5 |
15 | 2822e05 |
hex | 1ba01ed |
28967405 has 8 divisors (see below), whose sum is σ = 36805752. Its totient is φ = 21810688.
The previous prime is 28967399. The next prime is 28967429. The reversal of 28967405 is 50476982.
It can be written as a sum of positive squares in 4 ways, for example, as 376996 + 28590409 = 614^2 + 5347^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 28967405 - 220 = 27918829 is a prime.
It is a super-2 number, since 2×289674052 = 1678221104868050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 170312 + ... + 170481.
It is an arithmetic number, because the mean of its divisors is an integer number (4600719).
Almost surely, 228967405 is an apocalyptic number.
It is an amenable number.
28967405 is a deficient number, since it is larger than the sum of its proper divisors (7838347).
28967405 is a wasteful number, since it uses less digits than its factorization.
28967405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340815.
The product of its (nonzero) digits is 120960, while the sum is 41.
The square root of 28967405 is about 5382.1375864985. The cubic root of 28967405 is about 307.1165334776.
It can be divided in two parts, 2896 and 7405, that added together give a palindrome (10301).
The spelling of 28967405 in words is "twenty-eight million, nine hundred sixty-seven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •