Base | Representation |
---|---|
bin | 11000011110111110101… |
… | …010110110101001010001 |
3 | 12221211220111010122122100 |
4 | 120132332222312221101 |
5 | 210031310431231044 |
6 | 3324535533031013 |
7 | 232362455346264 |
oct | 30367652665121 |
9 | 5854814118570 |
10 | 1682531117649 |
11 | 599614a52738 |
12 | 232104325469 |
13 | c287b563bb5 |
14 | 5b613696cdb |
15 | 2db76dc8869 |
hex | 187beab6a51 |
1682531117649 has 12 divisors (see below), whose sum is σ = 2486841859216. Its totient is φ = 1095601657752.
The previous prime is 1682531117609. The next prime is 1682531117651. The reversal of 1682531117649 is 9467111352861.
1682531117649 is a `hidden beast` number, since 1 + 68 + 2 + 531 + 1 + 1 + 7 + 6 + 49 = 666.
It is not a de Polignac number, because 1682531117649 - 231 = 1680383634001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1682531117595 and 1682531117604.
It is not an unprimeable number, because it can be changed into a prime (1682531117609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2173812427 + ... + 2173813200.
Almost surely, 21682531117649 is an apocalyptic number.
It is an amenable number.
1682531117649 is a deficient number, since it is larger than the sum of its proper divisors (804310741567).
1682531117649 is a wasteful number, since it uses less digits than its factorization.
1682531117649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4347625676 (or 4347625673 counting only the distinct ones).
The product of its digits is 2177280, while the sum is 54.
The spelling of 1682531117649 in words is "one trillion, six hundred eighty-two billion, five hundred thirty-one million, one hundred seventeen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •