Base | Representation |
---|---|
bin | 11000100100010000010… |
… | …100111110011111100100 |
3 | 12222101112021202122022100 |
4 | 120210100110332133210 |
5 | 210124411144103021 |
6 | 3331314020532100 |
7 | 232653033633261 |
oct | 30442024763744 |
9 | 5871467678270 |
10 | 1688196081636 |
11 | 5a0a61749a59 |
12 | 233225551030 |
13 | c32720b58ac |
14 | 5b9cdbb2268 |
15 | 2dda93d1626 |
hex | 1891053e7e4 |
1688196081636 has 27 divisors (see below), whose sum is σ = 4267404245923. Its totient is φ = 562729428600.
The previous prime is 1688196081617. The next prime is 1688196081643. The reversal of 1688196081636 is 6361806918861.
The square root of 1688196081636 is 1299306.
It is a perfect power (a square), and thus also a powerful number.
1688196081636 is a `hidden beast` number, since 1 + 6 + 8 + 8 + 1 + 9 + 608 + 16 + 3 + 6 = 666.
It is a super-2 number, since 2×16881960816362 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 7687561 + ... + 7904111.
Almost surely, 21688196081636 is an apocalyptic number.
1688196081636 is the 1299306-th square number.
It is an amenable number.
1688196081636 is an abundant number, since it is smaller than the sum of its proper divisors (2579208164287).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1688196081636 is an frugal number, since it uses more digits than its factorization.
1688196081636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433112 (or 216556 counting only the distinct ones).
The product of its (nonzero) digits is 17915904, while the sum is 63.
The spelling of 1688196081636 in words is "one trillion, six hundred eighty-eight billion, one hundred ninety-six million, eighty-one thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •