Base | Representation |
---|---|
bin | 11000101001011… |
… | …001011100000000 |
3 | 1001211002020121101 |
4 | 120221121130000 |
5 | 1321324132110 |
6 | 105010504144 |
7 | 13150510516 |
oct | 3051313400 |
9 | 1054066541 |
10 | 413505280 |
11 | 1a245a701 |
12 | b6595054 |
13 | 6788c7a6 |
14 | 3ccbc4b6 |
15 | 2648013a |
hex | 18a59700 |
413505280 has 144 divisors (see below), whose sum is σ = 1084333824. Its totient is φ = 150405120.
The previous prime is 413505271. The next prime is 413505317. The reversal of 413505280 is 82505314.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 674254 + ... + 674866.
It is an arithmetic number, because the mean of its divisors is an integer number (7530096).
Almost surely, 2413505280 is an apocalyptic number.
413505280 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 413505280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (542166912).
413505280 is an abundant number, since it is smaller than the sum of its proper divisors (670828544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413505280 is a wasteful number, since it uses less digits than its factorization.
413505280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682 (or 668 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 413505280 is about 20334.8292345916. The cubic root of 413505280 is about 745.0069996189.
The spelling of 413505280 in words is "four hundred thirteen million, five hundred five thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •