Base | Representation |
---|---|
bin | 10100000101110011001011 |
3 | 100220120110120 |
4 | 110011303023 |
5 | 2322013020 |
6 | 304514323 |
7 | 62523423 |
oct | 24056313 |
9 | 10816416 |
10 | 5266635 |
11 | 2a779a0 |
12 | 191b9a3 |
13 | 112526a |
14 | 9b1483 |
15 | 6e0740 |
hex | 505ccb |
5266635 has 32 divisors (see below), whose sum is σ = 9365760. Its totient is φ = 2505600.
The previous prime is 5266631. The next prime is 5266649. The reversal of 5266635 is 5366625.
5266635 = 1502 + 1512 + ... + 2672.
5266635 is a nontrivial binomial coefficient, being equal to C(3246, 2).
It is not a de Polignac number, because 5266635 - 22 = 5266631 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5266596 and 5266605.
It is not an unprimeable number, because it can be changed into a prime (5266631) 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 31 ways as a sum of consecutive naturals, for example, 9465 + ... + 10005.
It is an arithmetic number, because the mean of its divisors is an integer number (292680).
Almost surely, 25266635 is an apocalyptic number.
5266635 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5266635 is the 3245-th triangular number and also the 1623-rd hexagonal number.
5266635 is a deficient number, since it is larger than the sum of its proper divisors (4099125).
5266635 is a wasteful number, since it uses less digits than its factorization.
5266635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619.
The product of its digits is 32400, while the sum is 33.
The square root of 5266635 is about 2294.9150311068. The cubic root of 5266635 is about 173.9847060147.
The spelling of 5266635 in words is "five million, two hundred sixty-six thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •