Base | Representation |
---|---|
bin | 1000101001001011010111… |
… | …11101111000101101001001 |
3 | 2111022001111102011222101212 |
4 | 10110211223331320231021 |
5 | 4442402410131414321 |
6 | 104231414151022505 |
7 | 4001133132333602 |
oct | 424455375705511 |
9 | 74261442158355 |
10 | 19007041669961 |
11 | 6068928567aa4 |
12 | 216b83796aa35 |
13 | a7b482b50b17 |
14 | 499d350dada9 |
15 | 22e63b91a55b |
hex | 11496bf78b49 |
19007041669961 has 2 divisors, whose sum is σ = 19007041669962. Its totient is φ = 19007041669960.
The previous prime is 19007041669841. The next prime is 19007041669999. The reversal of 19007041669961 is 16996614070091.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17652971983936 + 1354069686025 = 4201544^2 + 1163645^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19007041669961 is a prime.
It is a super-2 number, since 2×190070416699612 (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 19007041669961.
It is not a weakly prime, because it can be changed into another prime (19007041669061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9503520834980 + 9503520834981.
It is an arithmetic number, because the mean of its divisors is an integer number (9503520834981).
Almost surely, 219007041669961 is an apocalyptic number.
It is an amenable number.
19007041669961 is a deficient number, since it is larger than the sum of its proper divisors (1).
19007041669961 is an equidigital number, since it uses as much as digits as its factorization.
19007041669961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4408992, while the sum is 59.
The spelling of 19007041669961 in words is "nineteen trillion, seven billion, forty-one million, six hundred sixty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •