Base | Representation |
---|---|
bin | 11000001101111… |
… | …110010000000000 |
3 | 1001022112222210221 |
4 | 120031332100000 |
5 | 1313004103112 |
6 | 104152432424 |
7 | 13032425563 |
oct | 3015762000 |
9 | 1038488727 |
10 | 406316032 |
11 | 19939a281 |
12 | b40a8714 |
13 | 662433b5 |
14 | 3bd6a4da |
15 | 25a0ee07 |
hex | 1837e400 |
406316032 has 44 divisors (see below), whose sum is σ = 815033520. Its totient is φ = 202459136.
The previous prime is 406316023. The next prime is 406316033. The reversal of 406316032 is 230613604.
It is a junction number, because it is equal to n+sod(n) for n = 406315988 and 406316006.
It is not an unprimeable number, because it can be changed into a prime (406316033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 428583 + ... + 429529.
Almost surely, 2406316032 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 406316032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (407516760).
406316032 is an abundant number, since it is smaller than the sum of its proper divisors (408717488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406316032 is an equidigital number, since it uses as much as digits as its factorization.
406316032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1386 (or 1368 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
The square root of 406316032 is about 20157.2823565083. The cubic root of 406316032 is about 740.6641420132.
Adding to 406316032 its reverse (230613604), we get a palindrome (636929636).
The spelling of 406316032 in words is "four hundred six million, three hundred sixteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •