Base | Representation |
---|---|
bin | 1111001010100011110000 |
3 | 21110222020100 |
4 | 33022203300 |
5 | 2004203113 |
6 | 221112400 |
7 | 45535053 |
oct | 17124360 |
9 | 7428210 |
10 | 3975408 |
11 | 2275868 |
12 | 13b8700 |
13 | a92618 |
14 | 756a9a |
15 | 537d73 |
hex | 3ca8f0 |
3975408 has 60 divisors (see below), whose sum is σ = 11719240. Its totient is φ = 1254528.
The previous prime is 3975383. The next prime is 3975437. The reversal of 3975408 is 8045793.
3975408 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 2010 + ... + 3462.
Almost surely, 23975408 is an apocalyptic number.
3975408 is a gapful number since it is divisible by the number (38) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3975408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5859620).
3975408 is an abundant number, since it is smaller than the sum of its proper divisors (7743832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3975408 is a wasteful number, since it uses less digits than its factorization.
3975408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1486 (or 1477 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 3975408 is about 1993.8425213642. The cubic root of 3975408 is about 158.4141248500.
The spelling of 3975408 in words is "three million, nine hundred seventy-five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •