Base | Representation |
---|---|
bin | 10010111100100111001101 |
3 | 100100100020211 |
4 | 102330213031 |
5 | 2232414421 |
6 | 254242421 |
7 | 60134434 |
oct | 22744715 |
9 | 10310224 |
10 | 4966861 |
11 | 2892749 |
12 | 17b6411 |
13 | 104b993 |
14 | 93411b |
15 | 6819e1 |
hex | 4bc9cd |
4966861 has 4 divisors (see below), whose sum is σ = 4988412. Its totient is φ = 4945312.
The previous prime is 4966853. The next prime is 4966889. The reversal of 4966861 is 1686694.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1686694 = 2 ⋅843347.
It can be written as a sum of positive squares in 2 ways, for example, as 3572100 + 1394761 = 1890^2 + 1181^2 .
It is a cyclic number.
It is not a de Polignac number, because 4966861 - 23 = 4966853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4966811) 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, 10426 + ... + 10891.
It is an arithmetic number, because the mean of its divisors is an integer number (1247103).
Almost surely, 24966861 is an apocalyptic number.
It is an amenable number.
4966861 is a deficient number, since it is larger than the sum of its proper divisors (21551).
4966861 is a wasteful number, since it uses less digits than its factorization.
4966861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21550.
The product of its digits is 62208, while the sum is 40.
The square root of 4966861 is about 2228.6455527966. The cubic root of 4966861 is about 170.6189776797.
It can be divided in two parts, 49668 and 61, that added together give a square (49729 = 2232).
The spelling of 4966861 in words is "four million, nine hundred sixty-six thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •