Base | Representation |
---|---|
bin | 1111011110001111000000 |
3 | 21122001210020 |
4 | 33132033000 |
5 | 2014243000 |
6 | 222533440 |
7 | 46322034 |
oct | 17361700 |
9 | 7561706 |
10 | 4056000 |
11 | 2320373 |
12 | 1437280 |
13 | ac0200 |
14 | 7781c4 |
15 | 551ba0 |
hex | 3de3c0 |
4056000 has 168 divisors, whose sum is σ = 14502384. Its totient is φ = 998400.
The previous prime is 4055993. The next prime is 4056023. The reversal of 4056000 is 6504.
It is a super-2 number, since 2×40560002 = 32902272000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 311994 + ... + 312006.
Almost surely, 24056000 is an apocalyptic number.
4056000 is a gapful number since it is divisible by the number (40) 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 4056000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7251192).
4056000 is an abundant number, since it is smaller than the sum of its proper divisors (10446384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4056000 is a wasteful number, since it uses less digits than its factorization.
4056000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56 (or 23 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 4056000 is about 2013.9513400279. The cubic root of 4056000 is about 159.4774619871.
Multiplying 4056000 by its sum of digits (15), we get a square (60840000 = 78002).
4056000 divided by its sum of digits (15) gives a square (270400 = 5202).
The spelling of 4056000 in words is "four million, fifty-six thousand", and thus it is an eban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •