Base | Representation |
---|---|
bin | 11100110111111000000… |
… | …100111101101111011001 |
3 | 21000200102021011200112220 |
4 | 130313320010331233121 |
5 | 230002010321140424 |
6 | 4115300252254253 |
7 | 263230613340363 |
oct | 34677004755731 |
9 | 7020367150486 |
10 | 1984141974489 |
11 | 6a5519466584 |
12 | 280659171389 |
13 | 11514702a11c |
14 | 6c066717d33 |
15 | 3692abcd579 |
hex | 1cdf813dbd9 |
1984141974489 has 4 divisors (see below), whose sum is σ = 2645522632656. Its totient is φ = 1322761316324.
The previous prime is 1984141974443. The next prime is 1984141974511. The reversal of 1984141974489 is 9844791414891.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1984141974489 - 220 = 1984140925913 is a prime.
It is a super-3 number, since 3×19841419744893 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (1984141972489) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 330690329079 + ... + 330690329084.
It is an arithmetic number, because the mean of its divisors is an integer number (661380658164).
Almost surely, 21984141974489 is an apocalyptic number.
It is an amenable number.
1984141974489 is a deficient number, since it is larger than the sum of its proper divisors (661380658167).
1984141974489 is an equidigital number, since it uses as much as digits as its factorization.
1984141974489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661380658166.
The product of its digits is 83607552, while the sum is 69.
The spelling of 1984141974489 in words is "one trillion, nine hundred eighty-four billion, one hundred forty-one million, nine hundred seventy-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •