Base | Representation |
---|---|
bin | 1000111100100101111010… |
… | …11100001001011001010011 |
3 | 2120122211100211201111102012 |
4 | 10132102331130021121103 |
5 | 10034320103343104034 |
6 | 105502100404413135 |
7 | 4100260146616505 |
oct | 436227534113123 |
9 | 76584324644365 |
10 | 19674128488019 |
11 | 62a582969a985 |
12 | 2258b899a71ab |
13 | ac935451ac75 |
14 | 4c033910dd75 |
15 | 241b81253cce |
hex | 11e4bd709653 |
19674128488019 has 2 divisors, whose sum is σ = 19674128488020. Its totient is φ = 19674128488018.
The previous prime is 19674128488013. The next prime is 19674128488033. The reversal of 19674128488019 is 91088482147691.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 19674128488019 - 28 = 19674128487763 is a prime.
It is a super-2 number, since 2×196741284880192 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 19674128488019.
It is not a weakly prime, because it can be changed into another prime (19674128488013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9837064244009 + 9837064244010.
It is an arithmetic number, because the mean of its divisors is an integer number (9837064244010).
Almost surely, 219674128488019 is an apocalyptic number.
19674128488019 is a deficient number, since it is larger than the sum of its proper divisors (1).
19674128488019 is an equidigital number, since it uses as much as digits as its factorization.
19674128488019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55738368, while the sum is 68.
The spelling of 19674128488019 in words is "nineteen trillion, six hundred seventy-four billion, one hundred twenty-eight million, four hundred eighty-eight thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •