Base | Representation |
---|---|
bin | 10111111011110… |
… | …100001110110000 |
3 | 1000222121011211021 |
4 | 113323310032300 |
5 | 1310244301100 |
6 | 103502425224 |
7 | 12644113240 |
oct | 2773641660 |
9 | 1028534737 |
10 | 401556400 |
11 | 1967392a3 |
12 | b2592214 |
13 | 65267b4b |
14 | 3b48bb20 |
15 | 253bea1a |
hex | 17ef43b0 |
401556400 has 60 divisors (see below), whose sum is σ = 1102566832. Its totient is φ = 137675520.
The previous prime is 401556377. The next prime is 401556409. The reversal of 401556400 is 4655104.
It is a super-2 number, since 2×4015564002 = 322495084761920000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (401556409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 68907 + ... + 74506.
Almost surely, 2401556400 is an apocalyptic number.
401556400 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
401556400 is an abundant number, since it is smaller than the sum of its proper divisors (701010432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401556400 is a wasteful number, since it uses less digits than its factorization.
401556400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143438 (or 143427 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 401556400 is about 20038.8722237555. The cubic root of 401556400 is about 737.7607007090.
It can be divided in two parts, 401556 and 400, that added together give a square (401956 = 6342).
The spelling of 401556400 in words is "four hundred one million, five hundred fifty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •