Base | Representation |
---|---|
bin | 11000010000001110001… |
… | …011010110101011010000 |
3 | 12220100000011012000122202 |
4 | 120100032023112223100 |
5 | 204301332400341321 |
6 | 3313355315222332 |
7 | 231262004116316 |
oct | 30201613265320 |
9 | 5810004160582 |
10 | 1666685168336 |
11 | 592923366461 |
12 | 22b0215a79a8 |
13 | c1224697526 |
14 | 5a94cd860b6 |
15 | 2d54abb270b |
hex | 1840e2d6ad0 |
1666685168336 has 10 divisors (see below), whose sum is σ = 3229202513682. Its totient is φ = 833342584160.
The previous prime is 1666685168333. The next prime is 1666685168339. The reversal of 1666685168336 is 6338615866661.
It is an interprime number because it is at equal distance from previous prime (1666685168333) and next prime (1666685168339).
It can be written as a sum of positive squares in only one way, i.e., 1627012495936 + 39672672400 = 1275544^2 + 199180^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1666685168333) by changing a digit.
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 as a sum of consecutive naturals, namely, 52083911495 + ... + 52083911526.
Almost surely, 21666685168336 is an apocalyptic number.
1666685168336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1666685168336 is a deficient number, since it is larger than the sum of its proper divisors (1562517345346).
1666685168336 is a wasteful number, since it uses less digits than its factorization.
1666685168336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104167823029 (or 104167823023 counting only the distinct ones).
The product of its digits is 134369280, while the sum is 65.
The spelling of 1666685168336 in words is "one trillion, six hundred sixty-six billion, six hundred eighty-five million, one hundred sixty-eight thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •