Base | Representation |
---|---|
bin | 11110111011111000… |
… | …10111110000000001 |
3 | 1120212110210211122112 |
4 | 33131330113300001 |
5 | 233003233230140 |
6 | 11344013345105 |
7 | 1125400600031 |
oct | 173574276001 |
9 | 46773724575 |
10 | 16608492545 |
11 | 70530742a7 |
12 | 3276198195 |
13 | 1748b664a8 |
14 | b37ac98c1 |
15 | 67313ec65 |
hex | 3ddf17c01 |
16608492545 has 8 divisors (see below), whose sum is σ = 19930914024. Its totient is φ = 13286312064.
The previous prime is 16608492541. The next prime is 16608492547. The reversal of 16608492545 is 54529480661.
It can be written as a sum of positive squares in 4 ways, for example, as 1200483904 + 15408008641 = 34648^2 + 124129^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16608492545 - 22 = 16608492541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16608492493 and 16608492502.
It is not an unprimeable number, because it can be changed into a prime (16608492541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 174587 + ... + 252383.
It is an arithmetic number, because the mean of its divisors is an integer number (2491364253).
Almost surely, 216608492545 is an apocalyptic number.
It is an amenable number.
16608492545 is a deficient number, since it is larger than the sum of its proper divisors (3322421479).
16608492545 is an equidigital number, since it uses as much as digits as its factorization.
16608492545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120499.
The product of its (nonzero) digits is 2073600, while the sum is 50.
The spelling of 16608492545 in words is "sixteen billion, six hundred eight million, four hundred ninety-two thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •