Base | Representation |
---|---|
bin | 10101110001110010001001 |
3 | 101202001012010 |
4 | 111301302021 |
5 | 2430141222 |
6 | 322210133 |
7 | 66345063 |
oct | 25616211 |
9 | 11661163 |
10 | 5708937 |
11 | 324a233 |
12 | 1ab3949 |
13 | 124b690 |
14 | a88733 |
15 | 77b80c |
hex | 571c89 |
5708937 has 8 divisors (see below), whose sum is σ = 8197504. Its totient is φ = 3513168.
The previous prime is 5708933. The next prime is 5708939. The reversal of 5708937 is 7398075.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5708937 - 22 = 5708933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 146383 = 5708937 / (5 + 7 + 0 + 8 + 9 + 3 + 7).
It is an Ulam number.
It is a Duffinian number.
It is a nialpdrome in base 14.
It is a junction number, because it is equal to n+sod(n) for n = 5708895 and 5708904.
It is not an unprimeable number, because it can be changed into a prime (5708933) 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 7 ways as a sum of consecutive naturals, for example, 73153 + ... + 73230.
It is an arithmetic number, because the mean of its divisors is an integer number (1024688).
Almost surely, 25708937 is an apocalyptic number.
It is an amenable number.
5708937 is a deficient number, since it is larger than the sum of its proper divisors (2488567).
5708937 is a wasteful number, since it uses less digits than its factorization.
5708937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146399.
The product of its (nonzero) digits is 52920, while the sum is 39.
The square root of 5708937 is about 2389.3381928894. The cubic root of 5708937 is about 178.7249085357.
The spelling of 5708937 in words is "five million, seven hundred eight thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •