Base | Representation |
---|---|
bin | 101100110111010111100 |
3 | 2202200122122 |
4 | 11212322330 |
5 | 334021030 |
6 | 51302112 |
7 | 15332060 |
oct | 5467274 |
9 | 2680578 |
10 | 1470140 |
11 | 9145a1 |
12 | 5aa938 |
13 | 3c6209 |
14 | 2a3aa0 |
15 | 1e08e5 |
hex | 166ebc |
1470140 has 24 divisors (see below), whose sum is σ = 3528672. Its totient is φ = 504000.
The previous prime is 1470071. The next prime is 1470149. The reversal of 1470140 is 410741.
It is a super-2 number, since 2×14701402 = 4322623239200, which contains 22 as substring.
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1470149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5111 + ... + 5390.
It is an arithmetic number, because the mean of its divisors is an integer number (147028).
21470140 is an apocalyptic number.
1470140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1470140 is an abundant number, since it is smaller than the sum of its proper divisors (2058532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1470140 is a wasteful number, since it uses less digits than its factorization.
1470140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10517 (or 10515 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 17.
The square root of 1470140 is about 1212.4932989506. The cubic root of 1470140 is about 113.7067460229.
Adding to 1470140 its reverse (410741), we get a palindrome (1880881).
It can be divided in two parts, 14701 and 40, that added together give a palindrome (14741).
The spelling of 1470140 in words is "one million, four hundred seventy thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •