Base | Representation |
---|---|
bin | 111101011110100100001 |
3 | 10210100101000 |
4 | 13223310201 |
5 | 1003430442 |
6 | 111102213 |
7 | 23060112 |
oct | 7536441 |
9 | 3710330 |
10 | 2014497 |
11 | 1156581 |
12 | 811969 |
13 | 556c14 |
14 | 3a6209 |
15 | 29bd4c |
hex | 1ebd21 |
2014497 has 8 divisors (see below), whose sum is σ = 2984480. Its totient is φ = 1342980.
The previous prime is 2014487. The next prime is 2014499. The reversal of 2014497 is 7944102.
It is a happy number.
It is not a de Polignac number, because 2014497 - 211 = 2012449 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 74611 = 2014497 / (2 + 0 + 1 + 4 + 4 + 9 + 7).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2014497.
It is not an unprimeable number, because it can be changed into a prime (2014499) 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, 37279 + ... + 37332.
It is an arithmetic number, because the mean of its divisors is an integer number (373060).
22014497 is an apocalyptic number.
2014497 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
2014497 is a deficient number, since it is larger than the sum of its proper divisors (969983).
2014497 is an equidigital number, since it uses as much as digits as its factorization.
2014497 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74620 (or 74614 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 2014497 is about 1419.3297714062. The cubic root of 2014497 is about 126.2957903371.
Adding to 2014497 its reverse (7944102), we get a palindrome (9958599).
The spelling of 2014497 in words is "two million, fourteen thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •