Base | Representation |
---|---|
bin | 11000001101000… |
… | …001100001010000 |
3 | 1001022002100120220 |
4 | 120031001201100 |
5 | 1312423123110 |
6 | 104143233040 |
7 | 13030341423 |
oct | 3015014120 |
9 | 1038070526 |
10 | 406067280 |
11 | 19923a3a3 |
12 | b3ba8780 |
13 | 661870c8 |
14 | 3bd039ba |
15 | 259b1370 |
hex | 18341850 |
406067280 has 160 divisors (see below), whose sum is σ = 1334914560. Its totient is φ = 101928960.
The previous prime is 406067273. The next prime is 406067281. The reversal of 406067280 is 82760604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (406067281) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 284649 + ... + 286071.
It is an arithmetic number, because the mean of its divisors is an integer number (8343216).
Almost surely, 2406067280 is an apocalyptic number.
406067280 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 406067280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (667457280).
406067280 is an abundant number, since it is smaller than the sum of its proper divisors (928847280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406067280 is a wasteful number, since it uses less digits than its factorization.
406067280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1509 (or 1503 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 33.
The square root of 406067280 is about 20151.1111356173. Note that the first 4 decimals coincide. The cubic root of 406067280 is about 740.5129630594.
The spelling of 406067280 in words is "four hundred six million, sixty-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •