Base | Representation |
---|---|
bin | 101011000100… |
… | …011101001111 |
3 | 210020121120201 |
4 | 223010131033 |
5 | 10342243242 |
6 | 1041554331 |
7 | 164652520 |
oct | 53043517 |
9 | 23217521 |
10 | 11290447 |
11 | 6411753 |
12 | 39459a7 |
13 | 245404c |
14 | 16dc847 |
15 | ed04b7 |
hex | ac474f |
11290447 has 12 divisors (see below), whose sum is σ = 13493200. Its totient is φ = 9253728.
The previous prime is 11290441. The next prime is 11290453. The reversal of 11290447 is 74409211.
11290447 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11290441) and next prime (11290453).
It is not a de Polignac number, because 11290447 - 215 = 11257679 is a prime.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11290441) 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 11 ways as a sum of consecutive naturals, for example, 2179 + ... + 5227.
Almost surely, 211290447 is an apocalyptic number.
11290447 is a deficient number, since it is larger than the sum of its proper divisors (2202753).
11290447 is an equidigital number, since it uses as much as digits as its factorization.
11290447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3102 (or 3079 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 11290447 is about 3360.1260393027. The cubic root of 11290447 is about 224.3384485634.
Adding to 11290447 its reverse (74409211), we get a palindrome (85699658).
The spelling of 11290447 in words is "eleven million, two hundred ninety thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •