Base | Representation |
---|---|
bin | 1101111101100101011010100… |
… | …0010010010110111000010100 |
3 | 11202211202201102020021212022110 |
4 | 3133121112220102112320110 |
5 | 2012234342113210200133 |
6 | 13401341154402431020 |
7 | 413643522610124646 |
oct | 33731265022267024 |
9 | 4684681366255273 |
10 | 982506657115668 |
11 | 265069808056373 |
12 | 92240457662470 |
13 | 3322bc986c7579 |
14 | 1348980c510896 |
15 | 788c3bd70ec63 |
hex | 37d95a8496e14 |
982506657115668 has 12 divisors (see below), whose sum is σ = 2292515533269920. Its totient is φ = 327502219038552.
The previous prime is 982506657115619. The next prime is 982506657115679. The reversal of 982506657115668 is 866511756605289.
982506657115668 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 982506657115668.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40937777379808 + ... + 40937777379831.
Almost surely, 2982506657115668 is an apocalyptic number.
It is an amenable number.
982506657115668 is an abundant number, since it is smaller than the sum of its proper divisors (1310008876154252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
982506657115668 is a wasteful number, since it uses less digits than its factorization.
982506657115668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81875554759646 (or 81875554759644 counting only the distinct ones).
The product of its (nonzero) digits is 1306368000, while the sum is 75.
The spelling of 982506657115668 in words is "nine hundred eighty-two trillion, five hundred six billion, six hundred fifty-seven million, one hundred fifteen thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •