Base | Representation |
---|---|
bin | 1111001010011000110001 |
3 | 21110221021022 |
4 | 33022120301 |
5 | 2004142310 |
6 | 221105225 |
7 | 45533030 |
oct | 17123061 |
9 | 7427238 |
10 | 3974705 |
11 | 2275289 |
12 | 13b8215 |
13 | a921c7 |
14 | 756717 |
15 | 537a55 |
hex | 3ca631 |
3974705 has 32 divisors (see below), whose sum is σ = 5913600. Its totient is φ = 2503872.
The previous prime is 3974701. The next prime is 3974713. The reversal of 3974705 is 5074793.
3974705 = 192 + 202 + ... + 2282.
3974705 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3974705 - 22 = 3974701 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3974701) 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, 28526 + ... + 28664.
It is an arithmetic number, because the mean of its divisors is an integer number (184800).
Almost surely, 23974705 is an apocalyptic number.
3974705 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3974705 is a deficient number, since it is larger than the sum of its proper divisors (1938895).
3974705 is a wasteful number, since it uses less digits than its factorization.
3974705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213.
The product of its (nonzero) digits is 26460, while the sum is 35.
The square root of 3974705 is about 1993.6662208103. Note that the first 3 decimals coincide. The cubic root of 3974705 is about 158.4047864630.
The spelling of 3974705 in words is "three million, nine hundred seventy-four thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •