Base | Representation |
---|---|
bin | 111101111111… |
… | …111000110001 |
3 | 1010120201012011 |
4 | 331333320301 |
5 | 13130034330 |
6 | 1340202521 |
7 | 255100165 |
oct | 75777061 |
9 | 33521164 |
10 | 16252465 |
11 | 91a0799 |
12 | 5539441 |
13 | 34a0758 |
14 | 2230ca5 |
15 | 166082a |
hex | f7fe31 |
16252465 has 4 divisors (see below), whose sum is σ = 19502964. Its totient is φ = 13001968.
The previous prime is 16252427. The next prime is 16252471. The reversal of 16252465 is 56425261.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56425261 = 17 ⋅3319133.
It can be written as a sum of positive squares in 2 ways, for example, as 11992369 + 4260096 = 3463^2 + 2064^2 .
It is a cyclic number.
It is not a de Polignac number, because 16252465 - 29 = 16251953 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1625242 + ... + 1625251.
It is an arithmetic number, because the mean of its divisors is an integer number (4875741).
Almost surely, 216252465 is an apocalyptic number.
It is an amenable number.
16252465 is a deficient number, since it is larger than the sum of its proper divisors (3250499).
16252465 is an equidigital number, since it uses as much as digits as its factorization.
16252465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3250498.
The product of its digits is 14400, while the sum is 31.
The square root of 16252465 is about 4031.4346081761. The cubic root of 16252465 is about 253.3026576815.
The spelling of 16252465 in words is "sixteen million, two hundred fifty-two thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •