Base | Representation |
---|---|
bin | 11100110110010101000… |
… | …110100100101010000001 |
3 | 21000112010112121101102222 |
4 | 130312111012210222001 |
5 | 224440110222423044 |
6 | 4114423413420425 |
7 | 263141511205046 |
oct | 34662506445201 |
9 | 7015115541388 |
10 | 1982481451649 |
11 | 6a4847107156 |
12 | 28027503a715 |
13 | 114c40cc342a |
14 | 6bd49d8b1cd |
15 | 368800268ee |
hex | 1cd951a4a81 |
1982481451649 has 2 divisors, whose sum is σ = 1982481451650. Its totient is φ = 1982481451648.
The previous prime is 1982481451633. The next prime is 1982481451663. The reversal of 1982481451649 is 9461541842891.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1608475818049 + 374005633600 = 1268257^2 + 611560^2 .
It is a cyclic number.
It is not a de Polignac number, because 1982481451649 - 24 = 1982481451633 is a prime.
It is a super-2 number, since 2×19824814516492 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1982481451591 and 1982481451600.
It is not a weakly prime, because it can be changed into another prime (1982481451549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 991240725824 + 991240725825.
It is an arithmetic number, because the mean of its divisors is an integer number (991240725825).
Almost surely, 21982481451649 is an apocalyptic number.
It is an amenable number.
1982481451649 is a deficient number, since it is larger than the sum of its proper divisors (1).
1982481451649 is an equidigital number, since it uses as much as digits as its factorization.
1982481451649 is an evil number, because the sum of its binary digits is even.
The product of its digits is 19906560, while the sum is 62.
The spelling of 1982481451649 in words is "one trillion, nine hundred eighty-two billion, four hundred eighty-one million, four hundred fifty-one thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •