Base | Representation |
---|---|
bin | 110110110100… |
… | …0010111100001 |
3 | 2000002002112221 |
4 | 1231220113201 |
5 | 24324122131 |
6 | 2503551041 |
7 | 466164202 |
oct | 155502741 |
9 | 60062487 |
10 | 28739041 |
11 | 1524a081 |
12 | 975b481 |
13 | 5c53066 |
14 | 3b615a9 |
15 | 27ca411 |
hex | 1b685e1 |
28739041 has 4 divisors (see below), whose sum is σ = 28750084. Its totient is φ = 28728000.
The previous prime is 28739021. The next prime is 28739059. The reversal of 28739041 is 14093782.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 10497600 + 18241441 = 3240^2 + 4271^2 .
It is a cyclic number.
It is not a de Polignac number, because 28739041 - 223 = 20350433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28738988 and 28739006.
It is not an unprimeable number, because it can be changed into a prime (28739021) 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, 781 + ... + 7621.
It is an arithmetic number, because the mean of its divisors is an integer number (7187521).
Almost surely, 228739041 is an apocalyptic number.
It is an amenable number.
28739041 is a deficient number, since it is larger than the sum of its proper divisors (11043).
28739041 is an equidigital number, since it uses as much as digits as its factorization.
28739041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11042.
The product of its (nonzero) digits is 12096, while the sum is 34.
The square root of 28739041 is about 5360.8806179582. The cubic root of 28739041 is about 306.3073541894.
The spelling of 28739041 in words is "twenty-eight million, seven hundred thirty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •