Base | Representation |
---|---|
bin | 101011010110011010001 |
3 | 2200011120000 |
4 | 11122303101 |
5 | 330423442 |
6 | 50240213 |
7 | 15034251 |
oct | 5326321 |
9 | 2604500 |
10 | 1420497 |
11 | 890271 |
12 | 586069 |
13 | 3a9740 |
14 | 28d961 |
15 | 1d0d4c |
hex | 15acd1 |
1420497 has 40 divisors (see below), whose sum is σ = 2439360. Its totient is φ = 816480.
The previous prime is 1420493. The next prime is 1420501. The reversal of 1420497 is 7940241.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1420493) and next prime (1420501).
It is not a de Polignac number, because 1420497 - 22 = 1420493 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 1420497.
It is not an unprimeable number, because it can be changed into a prime (1420493) by changing a digit.
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 39 ways as a sum of consecutive naturals, for example, 19972 + ... + 20042.
It is an arithmetic number, because the mean of its divisors is an integer number (60984).
21420497 is an apocalyptic number.
It is an amenable number.
1420497 is a deficient number, since it is larger than the sum of its proper divisors (1018863).
1420497 is a wasteful number, since it uses less digits than its factorization.
1420497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115 (or 106 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 1420497 is about 1191.8460471051. The cubic root of 1420497 is about 112.4121981586.
Subtracting from 1420497 its product of nonzero digits (2016), we obtain a square (1418481 = 11912).
The spelling of 1420497 in words is "one million, four hundred twenty thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •