Base | Representation |
---|---|
bin | 110110110101… |
… | …0100010100101 |
3 | 2000002112202120 |
4 | 1231222202211 |
5 | 24324413231 |
6 | 2504100153 |
7 | 466232145 |
oct | 155524245 |
9 | 60075676 |
10 | 28747941 |
11 | 15255832 |
12 | 9764659 |
13 | 5c57121 |
14 | 3b64925 |
15 | 27ccd96 |
hex | 1b6a8a5 |
28747941 has 4 divisors (see below), whose sum is σ = 38330592. Its totient is φ = 19165292.
The previous prime is 28747921. The next prime is 28747949. The reversal of 28747941 is 14974782.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 28747941 - 27 = 28747813 is a prime.
It is a super-2 number, since 2×287479412 = 1652888223478962, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28747893 and 28747902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28747949) 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, 4791321 + ... + 4791326.
It is an arithmetic number, because the mean of its divisors is an integer number (9582648).
Almost surely, 228747941 is an apocalyptic number.
It is an amenable number.
28747941 is a deficient number, since it is larger than the sum of its proper divisors (9582651).
28747941 is an equidigital number, since it uses as much as digits as its factorization.
28747941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9582650.
The product of its digits is 112896, while the sum is 42.
The square root of 28747941 is about 5361.7106412040. The cubic root of 28747941 is about 306.3389703463.
The spelling of 28747941 in words is "twenty-eight million, seven hundred forty-seven thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •