Base | Representation |
---|---|
bin | 1001000100001000010001… |
… | …01011001111100101000111 |
3 | 2121120120210020012001210122 |
4 | 10202010020223033211013 |
5 | 10103040431211240341 |
6 | 110221045022212155 |
7 | 4125055344004415 |
oct | 442041053174507 |
9 | 77516706161718 |
10 | 19933088774471 |
11 | 6395636a5aa44 |
12 | 229b1bb12405b |
13 | b178b3a63ab2 |
14 | 4ccaa395a2b5 |
15 | 24878aa0294b |
hex | 122108acf947 |
19933088774471 has 2 divisors, whose sum is σ = 19933088774472. Its totient is φ = 19933088774470.
The previous prime is 19933088774449. The next prime is 19933088774513. The reversal of 19933088774471 is 17447788033991.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19933088774471 is a prime.
It is a super-3 number, since 3×199330887744713 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 19933088774395 and 19933088774404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19933088771471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9966544387235 + 9966544387236.
It is an arithmetic number, because the mean of its divisors is an integer number (9966544387236).
Almost surely, 219933088774471 is an apocalyptic number.
19933088774471 is a deficient number, since it is larger than the sum of its proper divisors (1).
19933088774471 is an equidigital number, since it uses as much as digits as its factorization.
19933088774471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256048128, while the sum is 71.
The spelling of 19933088774471 in words is "nineteen trillion, nine hundred thirty-three billion, eighty-eight million, seven hundred seventy-four thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •