Base | Representation |
---|---|
bin | 10101101011111001100001 |
3 | 101200211010101 |
4 | 111223321201 |
5 | 2423403313 |
6 | 321502401 |
7 | 66214600 |
oct | 25537141 |
9 | 11624111 |
10 | 5684833 |
11 | 3233110 |
12 | 1aa1a01 |
13 | 124070b |
14 | a7da37 |
15 | 7745dd |
hex | 56be61 |
5684833 has 24 divisors (see below), whose sum is σ = 7387200. Its totient is φ = 4324320.
The previous prime is 5684771. The next prime is 5684837. The reversal of 5684833 is 3384865.
It is not a de Polignac number, because 5684833 - 213 = 5676641 is a prime.
It is a Duffinian number.
Its product of digits (69120) is a multiple of the sum of its prime divisors (270).
It is a junction number, because it is equal to n+sod(n) for n = 5684792 and 5684801.
It is not an unprimeable number, because it can be changed into a prime (5684837) 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 23 ways as a sum of consecutive naturals, for example, 28468 + ... + 28666.
It is an arithmetic number, because the mean of its divisors is an integer number (307800).
Almost surely, 25684833 is an apocalyptic number.
5684833 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
5684833 is a deficient number, since it is larger than the sum of its proper divisors (1702367).
5684833 is a wasteful number, since it uses less digits than its factorization.
5684833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277 (or 270 counting only the distinct ones).
The product of its digits is 69120, while the sum is 37.
The square root of 5684833 is about 2384.2887828449. The cubic root of 5684833 is about 178.4730191182.
Subtracting from 5684833 its reverse (3384865), we obtain a cube (2299968 = 1323).
The spelling of 5684833 in words is "five million, six hundred eighty-four thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •