Base | Representation |
---|---|
bin | 10111110110110… |
… | …110000100010000 |
3 | 1000220010222011121 |
4 | 113312312010100 |
5 | 1304431100300 |
6 | 103414452024 |
7 | 12630044644 |
oct | 2766660420 |
9 | 1026128147 |
10 | 400253200 |
11 | 195a29176 |
12 | b2064014 |
13 | 64bcc919 |
14 | 3b22cc24 |
15 | 2521381a |
hex | 17db6110 |
400253200 has 60 divisors (see below), whose sum is σ = 969303040. Its totient is φ = 158820480.
The previous prime is 400253197. The next prime is 400253201. The reversal of 400253200 is 2352004.
It is a super-2 number, since 2×4002532002 = 320405248220480000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (400253201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46861 + ... + 54739.
Almost surely, 2400253200 is an apocalyptic number.
400253200 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 400253200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (484651520).
400253200 is an abundant number, since it is smaller than the sum of its proper divisors (569049840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400253200 is a wasteful number, since it uses less digits than its factorization.
400253200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8024 (or 8013 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 16.
The square root of 400253200 is about 20006.3289985944. The cubic root of 400253200 is about 736.9617330655.
The spelling of 400253200 in words is "four hundred million, two hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •