Base | Representation |
---|---|
bin | 1000101001001011010111… |
… | …11101111000011101001101 |
3 | 2111022001111102011221000002 |
4 | 10110211223331320131031 |
5 | 4442402410131401231 |
6 | 104231414151014045 |
7 | 4001133132330614 |
oct | 424455375703515 |
9 | 74261442157002 |
10 | 19007041668941 |
11 | 6068928567257 |
12 | 216b83796a325 |
13 | a7b482b50511 |
14 | 499d350da87b |
15 | 22e63b91a0cb |
hex | 11496bf7874d |
19007041668941 has 2 divisors, whose sum is σ = 19007041668942. Its totient is φ = 19007041668940.
The previous prime is 19007041668919. The next prime is 19007041669039. The reversal of 19007041668941 is 14986614070091.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11840825102500 + 7166216566441 = 3441050^2 + 2676979^2 .
It is an emirp because it is prime and its reverse (14986614070091) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 19007041668941 - 210 = 19007041667917 is a prime.
It is a super-2 number, since 2×190070416689412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19007041668541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9503520834470 + 9503520834471.
It is an arithmetic number, because the mean of its divisors is an integer number (9503520834471).
Almost surely, 219007041668941 is an apocalyptic number.
It is an amenable number.
19007041668941 is a deficient number, since it is larger than the sum of its proper divisors (1).
19007041668941 is an equidigital number, since it uses as much as digits as its factorization.
19007041668941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 56.
The spelling of 19007041668941 in words is "nineteen trillion, seven billion, forty-one million, six hundred sixty-eight thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •