Base | Representation |
---|---|
bin | 110110001100… |
… | …1010001011011 |
3 | 1222110122010220 |
4 | 1230121101123 |
5 | 24233240232 |
6 | 2453011123 |
7 | 463344522 |
oct | 154312133 |
9 | 58418126 |
10 | 28415067 |
11 | 1504872a |
12 | 9623aa3 |
13 | 5b6b765 |
14 | 3ab94b9 |
15 | 276442c |
hex | 1b1945b |
28415067 has 4 divisors (see below), whose sum is σ = 37886760. Its totient is φ = 18943376.
The previous prime is 28415063. The next prime is 28415071. The reversal of 28415067 is 76051482.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (28415063) and next prime (28415071).
It is a cyclic number.
It is not a de Polignac number, because 28415067 - 22 = 28415063 is a prime.
It is a super-2 number, since 2×284150672 = 1614832065228978, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (28415063) 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, 4735842 + ... + 4735847.
It is an arithmetic number, because the mean of its divisors is an integer number (9471690).
Almost surely, 228415067 is an apocalyptic number.
28415067 is a deficient number, since it is larger than the sum of its proper divisors (9471693).
28415067 is an equidigital number, since it uses as much as digits as its factorization.
28415067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9471692.
The product of its (nonzero) digits is 13440, while the sum is 33.
The square root of 28415067 is about 5330.5784864309. The cubic root of 28415067 is about 305.1520052132.
It can be divided in two parts, 284 and 15067, that added together give a palindrome (15351).
The spelling of 28415067 in words is "twenty-eight million, four hundred fifteen thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •