Base | Representation |
---|---|
bin | 1111001010001111000100… |
… | …0001000001010110000001 |
3 | 2012000111100120212002200200 |
4 | 3302203301001001112001 |
5 | 4141044110232411220 |
6 | 55241224424435413 |
7 | 3340155245050251 |
oct | 362436101012601 |
9 | 65014316762620 |
10 | 16668516685185 |
11 | 5347095137722 |
12 | 1a52578618b69 |
13 | 93bab0190591 |
14 | 418a90bb9961 |
15 | 1dd8be008890 |
hex | f28f1041581 |
16668516685185 has 48 divisors (see below), whose sum is σ = 28947026681040. Its totient is φ = 8872989143040.
The previous prime is 16668516685157. The next prime is 16668516685291. The reversal of 16668516685185 is 58158661586661.
It can be written as a sum of positive squares in 8 ways, for example, as 196859041344 + 16471657643841 = 443688^2 + 4058529^2 .
It is not a de Polignac number, because 16668516685185 - 225 = 16668483130753 is a prime.
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 47 ways as a sum of consecutive naturals, for example, 51973401 + ... + 52293129.
It is an arithmetic number, because the mean of its divisors is an integer number (603063055855).
Almost surely, 216668516685185 is an apocalyptic number.
16668516685185 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16668516685185 is a deficient number, since it is larger than the sum of its proper divisors (12278509995855).
16668516685185 is a wasteful number, since it uses less digits than its factorization.
16668516685185 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321938 (or 321935 counting only the distinct ones).
The product of its digits is 497664000, while the sum is 72.
The spelling of 16668516685185 in words is "sixteen trillion, six hundred sixty-eight billion, five hundred sixteen million, six hundred eighty-five thousand, one hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •