Base | Representation |
---|---|
bin | 10010011010011000111010 |
3 | 100002012222000 |
4 | 102122120322 |
5 | 2213423212 |
6 | 251241430 |
7 | 56011650 |
oct | 22323072 |
9 | 10065860 |
10 | 4826682 |
11 | 27a73a3 |
12 | 1749276 |
13 | cccc33 |
14 | 8d8dd0 |
15 | 6551dc |
hex | 49a63a |
4826682 has 48 divisors (see below), whose sum is σ = 12367680. Its totient is φ = 1366848.
The previous prime is 4826641. The next prime is 4826693. The reversal of 4826682 is 2866284.
It is a d-powerful number, because it can be written as 410 + 8 + 2 + 64 + 68 + 87 + 25 .
It is a nialpdrome in base 13.
It is a zygodrome in base 13.
It is an unprimeable number.
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, 42658 + ... + 42770.
It is an arithmetic number, because the mean of its divisors is an integer number (257660).
Almost surely, 24826682 is an apocalyptic number.
4826682 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 4826682, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6183840).
4826682 is an abundant number, since it is smaller than the sum of its proper divisors (7540998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4826682 is a wasteful number, since it uses less digits than its factorization.
4826682 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244 (or 125 counting only the distinct ones).
The product of its digits is 36864, while the sum is 36.
The square root of 4826682 is about 2196.9710967603. The cubic root of 4826682 is about 168.9985177793.
The spelling of 4826682 in words is "four million, eight hundred twenty-six thousand, six hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •