Base | Representation |
---|---|
bin | 11100110110010000100… |
… | …010011010100110111001 |
3 | 21000111221012111100112201 |
4 | 130312100202122212321 |
5 | 224434431121130231 |
6 | 4114412040110201 |
7 | 263136561214531 |
oct | 34662042324671 |
9 | 7014835440481 |
10 | 1982404864441 |
11 | 6a4807957041 |
12 | 280253465361 |
13 | 114c2b189561 |
14 | 6bd3db324c1 |
15 | 36878449161 |
hex | 1cd9089a9b9 |
1982404864441 has 27 divisors (see below), whose sum is σ = 2099766395181. Its totient is φ = 1871508214464.
The previous prime is 1982404864417. The next prime is 1982404864457. The reversal of 1982404864441 is 1444684042891.
It is a happy number.
The square root of 1982404864441 is 1407979.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 674574755625 + 1307830108816 = 821325^2 + 1143604^2 .
It is not a de Polignac number, because 1982404864441 - 25 = 1982404864409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1982404862441) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1919074861 + ... + 1919075893.
Almost surely, 21982404864441 is an apocalyptic number.
1982404864441 is the 1407979-th square number.
1982404864441 is the 703990-th centered octagonal number.
It is an amenable number.
1982404864441 is a deficient number, since it is larger than the sum of its proper divisors (117361530740).
1982404864441 is an frugal number, since it uses more digits than its factorization.
1982404864441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2218 (or 1109 counting only the distinct ones).
The product of its (nonzero) digits is 7077888, while the sum is 55.
The spelling of 1982404864441 in words is "one trillion, nine hundred eighty-two billion, four hundred four million, eight hundred sixty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •