Base | Representation |
---|---|
bin | 11100110100100001011… |
… | …010000000010001110011 |
3 | 21000100010021011011100000 |
4 | 130310201122000101303 |
5 | 224422121314412332 |
6 | 4113503034001043 |
7 | 263042431351524 |
oct | 34644132002163 |
9 | 7010107134300 |
10 | 1980540388467 |
11 | 6a3a40464703 |
12 | 27ba12b76183 |
13 | 1149c1b13134 |
14 | 6bc0427484b |
15 | 367b9906b7c |
hex | 1cd21680473 |
1980540388467 has 48 divisors (see below), whose sum is σ = 2975462380800. Its totient is φ = 1316482064352.
The previous prime is 1980540388457. The next prime is 1980540388487. The reversal of 1980540388467 is 7648830450891.
1980540388467 is a `hidden beast` number, since 1 + 9 + 8 + 0 + 540 + 3 + 8 + 84 + 6 + 7 = 666.
It is not a de Polignac number, because 1980540388467 - 26 = 1980540388403 is a prime.
It is a super-2 number, since 2×19805403884672 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1980540388457) 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 in 47 ways as a sum of consecutive naturals, for example, 120367413 + ... + 120383865.
It is an arithmetic number, because the mean of its divisors is an integer number (61988799600).
Almost surely, 21980540388467 is an apocalyptic number.
1980540388467 is a deficient number, since it is larger than the sum of its proper divisors (994921992333).
1980540388467 is an equidigital number, since it uses as much as digits as its factorization.
1980540388467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17894 (or 17882 counting only the distinct ones).
The product of its (nonzero) digits is 46448640, while the sum is 63.
The spelling of 1980540388467 in words is "one trillion, nine hundred eighty billion, five hundred forty million, three hundred eighty-eight thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •