Base | Representation |
---|---|
bin | 1111010010000100111000 |
3 | 21112112110210 |
4 | 33102010320 |
5 | 2011144300 |
6 | 221511120 |
7 | 46023612 |
oct | 17220470 |
9 | 7475423 |
10 | 4006200 |
11 | 2296a10 |
12 | 14124a0 |
13 | aa3643 |
14 | 763db2 |
15 | 542050 |
hex | 3d2138 |
4006200 has 96 divisors (see below), whose sum is σ = 13570560. Its totient is φ = 969600.
The previous prime is 4006183. The next prime is 4006201. The reversal of 4006200 is 26004.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4006201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6297 + ... + 6903.
It is an arithmetic number, because the mean of its divisors is an integer number (141360).
Almost surely, 24006200 is an apocalyptic number.
4006200 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 4006200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6785280).
4006200 is an abundant number, since it is smaller than the sum of its proper divisors (9564360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4006200 is a wasteful number, since it uses less digits than its factorization.
4006200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 637 (or 628 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 4006200 is about 2001.5493998400. The cubic root of 4006200 is about 158.8220785795.
The spelling of 4006200 in words is "four million, six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •