Base | Representation |
---|---|
bin | 11000010000010… |
… | …000000100110000 |
3 | 1001100200100011000 |
4 | 120100100010300 |
5 | 1313132211303 |
6 | 104213322000 |
7 | 13040464143 |
oct | 3020200460 |
9 | 1040610130 |
10 | 406913328 |
11 | 199768008 |
12 | b4336300 |
13 | 663c2223 |
14 | 3c08405a |
15 | 25acbda3 |
hex | 18410130 |
406913328 has 40 divisors (see below), whose sum is σ = 1167993200. Its totient is φ = 135637632.
The previous prime is 406913323. The next prime is 406913359. The reversal of 406913328 is 823319604.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 406913292 and 406913301.
It is not an unprimeable number, because it can be changed into a prime (406913323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 470533 + ... + 471396.
It is an arithmetic number, because the mean of its divisors is an integer number (29199830).
Almost surely, 2406913328 is an apocalyptic number.
406913328 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
406913328 is an abundant number, since it is smaller than the sum of its proper divisors (761079872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406913328 is a wasteful number, since it uses less digits than its factorization.
406913328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 941946 (or 941934 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The square root of 406913328 is about 20172.0928016902. The cubic root of 406913328 is about 741.0268966945.
The spelling of 406913328 in words is "four hundred six million, nine hundred thirteen thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •