Base | Representation |
---|---|
bin | 11110111001100000000 |
3 | 1220102212021 |
4 | 3313030000 |
5 | 224344410 |
6 | 33411224 |
7 | 11414560 |
oct | 3671400 |
9 | 1812767 |
10 | 1012480 |
11 | 631767 |
12 | 409b14 |
13 | 295b01 |
14 | 1c4da0 |
15 | 14eeda |
hex | f7300 |
1012480 has 72 divisors (see below), whose sum is σ = 2796192. Its totient is φ = 344064.
The previous prime is 1012463. The next prime is 1012481. The reversal of 1012480 is 842101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a nialpdrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (1012481) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8904 + ... + 9016.
It is an arithmetic number, because the mean of its divisors is an integer number (38836).
21012480 is an apocalyptic number.
1012480 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 1012480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1398096).
1012480 is an abundant number, since it is smaller than the sum of its proper divisors (1783712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012480 is an equidigital number, since it uses as much as digits as its factorization.
1012480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141 (or 127 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 1012480 is about 1006.2206517459. The cubic root of 1012480 is about 100.4142813396.
Adding to 1012480 its reverse (842101), we get a palindrome (1854581).
The spelling of 1012480 in words is "one million, twelve thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •