Base | Representation |
---|---|
bin | 10111110110001… |
… | …001011010111000 |
3 | 1000212210200022120 |
4 | 113312021122320 |
5 | 1304404222303 |
6 | 103410521240 |
7 | 12625353540 |
oct | 2766113270 |
9 | 1025720276 |
10 | 400070328 |
11 | 195913839 |
12 | b1b96220 |
13 | 64b67608 |
14 | 3b1c2320 |
15 | 251c9553 |
hex | 17d896b8 |
400070328 has 64 divisors (see below), whose sum is σ = 1148160000. Its totient is φ = 113795712.
The previous prime is 400070311. The next prime is 400070329. The reversal of 400070328 is 823070004.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 400070298 and 400070307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400070329) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33273 + ... + 43671.
It is an arithmetic number, because the mean of its divisors is an integer number (17940000).
Almost surely, 2400070328 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 400070328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (574080000).
400070328 is an abundant number, since it is smaller than the sum of its proper divisors (748089672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400070328 is a wasteful number, since it uses less digits than its factorization.
400070328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10644 (or 10640 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 400070328 is about 20001.7581227251. The cubic root of 400070328 is about 736.8494789588.
The spelling of 400070328 in words is "four hundred million, seventy thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •