Base | Representation |
---|---|
bin | 100000011010… |
… | …011101010101 |
3 | 120222200200000 |
4 | 200122131111 |
5 | 4133400411 |
6 | 502041513 |
7 | 132136353 |
oct | 40323525 |
9 | 16880600 |
10 | 8496981 |
11 | 48839a9 |
12 | 2a19299 |
13 | 19b66cc |
14 | 11b27d3 |
15 | b2c956 |
hex | 81a755 |
8496981 has 24 divisors (see below), whose sum is σ = 12929280. Its totient is φ = 5575392.
The previous prime is 8496979. The next prime is 8497031. The reversal of 8496981 is 1896948.
It is not a de Polignac number, because 8496981 - 21 = 8496979 is a prime.
It is a super-2 number, since 2×84969812 = 144397372228722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8496941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17500 + ... + 17978.
It is an arithmetic number, because the mean of its divisors is an integer number (538720).
Almost surely, 28496981 is an apocalyptic number.
8496981 is a gapful number since it is divisible by the number (81) formed by its first and last digit.
It is an amenable number.
8496981 is a deficient number, since it is larger than the sum of its proper divisors (4432299).
8496981 is an equidigital number, since it uses as much as digits as its factorization.
8496981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567 (or 555 counting only the distinct ones).
The product of its digits is 124416, while the sum is 45.
The square root of 8496981 is about 2914.9581472124. The cubic root of 8496981 is about 204.0585904372.
The spelling of 8496981 in words is "eight million, four hundred ninety-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •