Base | Representation |
---|---|
bin | 101101101101… |
… | …100001100011 |
3 | 211112210111212 |
4 | 231231201203 |
5 | 11031423242 |
6 | 1104500335 |
7 | 203565464 |
oct | 55554143 |
9 | 24483455 |
10 | 11982947 |
11 | 6844a69 |
12 | 401a6ab |
13 | 2637302 |
14 | 183cd6b |
15 | 10ba782 |
hex | b6d863 |
11982947 has 4 divisors (see below), whose sum is σ = 12275256. Its totient is φ = 11690640.
The previous prime is 11982941. The next prime is 11982953. The reversal of 11982947 is 74928911.
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 (11982941) and next prime (11982953).
It is a cyclic number.
It is not a de Polignac number, because 11982947 - 212 = 11978851 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41), and also a Moran number because the ratio is a prime number: 292267 = 11982947 / (1 + 1 + 9 + 8 + 2 + 9 + 4 + 7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11982941) 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, 146093 + ... + 146174.
It is an arithmetic number, because the mean of its divisors is an integer number (3068814).
Almost surely, 211982947 is an apocalyptic number.
11982947 is a deficient number, since it is larger than the sum of its proper divisors (292309).
11982947 is an equidigital number, since it uses as much as digits as its factorization.
11982947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292308.
The product of its digits is 36288, while the sum is 41.
The square root of 11982947 is about 3461.6393515212. The cubic root of 11982947 is about 228.8343481430.
The spelling of 11982947 in words is "eleven million, nine hundred eighty-two thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •