Base | Representation |
---|---|
bin | 11010000010011011101001 |
3 | 110211210002220 |
4 | 122002123221 |
5 | 3221410310 |
6 | 402144253 |
7 | 112006005 |
oct | 32023351 |
9 | 13753086 |
10 | 6825705 |
11 | 3942287 |
12 | 2352089 |
13 | 154caa3 |
14 | c99705 |
15 | 8ec670 |
hex | 6826e9 |
6825705 has 8 divisors (see below), whose sum is σ = 10921152. Its totient is φ = 3640368.
The previous prime is 6825703. The next prime is 6825737. The reversal of 6825705 is 5075286.
It is a happy number.
6825705 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6825705 - 21 = 6825703 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6825703) 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, 227509 + ... + 227538.
It is an arithmetic number, because the mean of its divisors is an integer number (1365144).
Almost surely, 26825705 is an apocalyptic number.
It is an amenable number.
6825705 is a deficient number, since it is larger than the sum of its proper divisors (4095447).
6825705 is a wasteful number, since it uses less digits than its factorization.
6825705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455055.
The product of its (nonzero) digits is 16800, while the sum is 33.
The square root of 6825705 is about 2612.6050218125. The cubic root of 6825705 is about 189.6920681500.
The spelling of 6825705 in words is "six million, eight hundred twenty-five thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •