Base | Representation |
---|---|
bin | 10010101101111010000111 |
3 | 100020021122002 |
4 | 102231322013 |
5 | 2224003011 |
6 | 253055515 |
7 | 56464022 |
oct | 22557207 |
9 | 10207562 |
10 | 4906631 |
11 | 2851474 |
12 | 178759b |
13 | 102a442 |
14 | 91a1b9 |
15 | 66dc3b |
hex | 4ade87 |
4906631 has 2 divisors, whose sum is σ = 4906632. Its totient is φ = 4906630.
The previous prime is 4906621. The next prime is 4906633. The reversal of 4906631 is 1366094.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4906631 - 214 = 4890247 is a prime.
It is a super-2 number, since 2×49066312 = 48150055540322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 4906633, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4906594 and 4906603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4906633) 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 as a sum of consecutive naturals, namely, 2453315 + 2453316.
It is an arithmetic number, because the mean of its divisors is an integer number (2453316).
Almost surely, 24906631 is an apocalyptic number.
4906631 is a deficient number, since it is larger than the sum of its proper divisors (1).
4906631 is an equidigital number, since it uses as much as digits as its factorization.
4906631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 4906631 is about 2215.0916459596. The cubic root of 4906631 is about 169.9265080260.
The spelling of 4906631 in words is "four million, nine hundred six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •