Base | Representation |
---|---|
bin | 100111111111… |
… | …111000100000 |
3 | 201201201002201 |
4 | 213333320200 |
5 | 10141012110 |
6 | 1012422544 |
7 | 155060221 |
oct | 47777040 |
9 | 21651081 |
10 | 10485280 |
11 | 5a11823 |
12 | 3617a54 |
13 | 2231710 |
14 | 156d248 |
15 | dc1b3a |
hex | 9ffe20 |
10485280 has 72 divisors (see below), whose sum is σ = 27057996. Its totient is φ = 3816960.
The previous prime is 10485271. The next prime is 10485287. The reversal of 10485280 is 8258401.
It can be written as a sum of positive squares in 2 ways, for example, as 9759376 + 725904 = 3124^2 + 852^2 .
It is not an unprimeable number, because it can be changed into a prime (10485287) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 147645 + ... + 147715.
Almost surely, 210485280 is an apocalyptic number.
10485280 is a gapful number since it is divisible by the number (10) 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 10485280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13528998).
10485280 is an abundant number, since it is smaller than the sum of its proper divisors (16572716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10485280 is an equidigital number, since it uses as much as digits as its factorization.
10485280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 28.
The square root of 10485280 is about 3238.0982072816. The cubic root of 10485280 is about 218.8735813269.
It can be divided in two parts, 1048 and 5280, that added together give a triangular number (6328 = T112).
The spelling of 10485280 in words is "ten million, four hundred eighty-five thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •