Base | Representation |
---|---|
bin | 111110111000… |
… | …110101110001 |
3 | 1011000120012011 |
4 | 332320311301 |
5 | 13210020440 |
6 | 1345202521 |
7 | 260061253 |
oct | 76706561 |
9 | 34016164 |
10 | 16485745 |
11 | 933aa91 |
12 | 5630441 |
13 | 35529a3 |
14 | 2291cd3 |
15 | 16a99ea |
hex | fb8d71 |
16485745 has 4 divisors (see below), whose sum is σ = 19782900. Its totient is φ = 13188592.
The previous prime is 16485701. The next prime is 16485751. The reversal of 16485745 is 54758461.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54758461 = 1753 ⋅31237.
It can be written as a sum of positive squares in 2 ways, for example, as 3265249 + 13220496 = 1807^2 + 3636^2 .
It is a cyclic number.
It is not a de Polignac number, because 16485745 - 27 = 16485617 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 16485698 and 16485707.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1648570 + ... + 1648579.
It is an arithmetic number, because the mean of its divisors is an integer number (4945725).
Almost surely, 216485745 is an apocalyptic number.
It is an amenable number.
16485745 is a deficient number, since it is larger than the sum of its proper divisors (3297155).
16485745 is an equidigital number, since it uses as much as digits as its factorization.
16485745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3297154.
The product of its digits is 134400, while the sum is 40.
The square root of 16485745 is about 4060.2641539683. The cubic root of 16485745 is about 254.5088328383.
The spelling of 16485745 in words is "sixteen million, four hundred eighty-five thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •