Base | Representation |
---|---|
bin | 111000111100… |
… | …101001110001 |
3 | 1001002110001022 |
4 | 320330221301 |
5 | 12310202442 |
6 | 1251545225 |
7 | 240614213 |
oct | 70745161 |
9 | 31073038 |
10 | 14928497 |
11 | 8477001 |
12 | 4bbb215 |
13 | 3128c3c |
14 | 1da85b3 |
15 | 149d3d2 |
hex | e3ca71 |
14928497 has 4 divisors (see below), whose sum is σ = 14936436. Its totient is φ = 14920560.
The previous prime is 14928493. The next prime is 14928503. The reversal of 14928497 is 79482941.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 79482941 = 1567 ⋅50723.
It can be written as a sum of positive squares in 2 ways, for example, as 9928801 + 4999696 = 3151^2 + 2236^2 .
It is a cyclic number.
It is not a de Polignac number, because 14928497 - 22 = 14928493 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14928491) 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 3 ways as a sum of consecutive naturals, for example, 623 + ... + 5499.
It is an arithmetic number, because the mean of its divisors is an integer number (3734109).
Almost surely, 214928497 is an apocalyptic number.
It is an amenable number.
14928497 is a deficient number, since it is larger than the sum of its proper divisors (7939).
14928497 is an equidigital number, since it uses as much as digits as its factorization.
14928497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7938.
The product of its digits is 145152, while the sum is 44.
The square root of 14928497 is about 3863.7413215690. The cubic root of 14928497 is about 246.2287129769.
The spelling of 14928497 in words is "fourteen million, nine hundred twenty-eight thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •