Base | Representation |
---|---|
bin | 110110110100… |
… | …1010111110101 |
3 | 2000002022012101 |
4 | 1231221113311 |
5 | 24324240112 |
6 | 2504022101 |
7 | 466212202 |
oct | 155512765 |
9 | 60068171 |
10 | 28743157 |
11 | 15252183 |
12 | 9761931 |
13 | 5c54bb1 |
14 | 3b62ca9 |
15 | 27cb757 |
hex | 1b695f5 |
28743157 has 4 divisors (see below), whose sum is σ = 28786540. Its totient is φ = 28699776.
The previous prime is 28743151. The next prime is 28743163. The reversal of 28743157 is 75134782.
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 (28743151) and next prime (28743163).
It can be written as a sum of positive squares in 2 ways, for example, as 8031556 + 20711601 = 2834^2 + 4551^2 .
It is a cyclic number.
It is not a de Polignac number, because 28743157 - 211 = 28741109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28743151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20682 + ... + 22027.
It is an arithmetic number, because the mean of its divisors is an integer number (7196635).
Almost surely, 228743157 is an apocalyptic number.
It is an amenable number.
28743157 is a deficient number, since it is larger than the sum of its proper divisors (43383).
28743157 is an equidigital number, since it uses as much as digits as its factorization.
28743157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43382.
The product of its digits is 47040, while the sum is 37.
The square root of 28743157 is about 5361.2644963665. The cubic root of 28743157 is about 306.3219765850.
It can be divided in two parts, 28743 and 157, that added together give a square (28900 = 1702).
The spelling of 28743157 in words is "twenty-eight million, seven hundred forty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •