Base | Representation |
---|---|
bin | 1000101101000000111001… |
… | …00101111011100001100001 |
3 | 2111202122201122021220202112 |
4 | 10112200130211323201201 |
5 | 10002032333104214121 |
6 | 104412133530125105 |
7 | 4013510433421523 |
oct | 426403445734141 |
9 | 74678648256675 |
10 | 19138853976161 |
11 | 6109819136647 |
12 | 21912a3580795 |
13 | a8aa2b333b8a |
14 | 4a247b163a13 |
15 | 232ca391875b |
hex | 11681c97b861 |
19138853976161 has 2 divisors, whose sum is σ = 19138853976162. Its totient is φ = 19138853976160.
The previous prime is 19138853976157. The next prime is 19138853976233. The reversal of 19138853976161 is 16167935883191.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12903045910561 + 6235808065600 = 3592081^2 + 2497160^2 .
It is an emirp because it is prime and its reverse (16167935883191) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 19138853976161 - 22 = 19138853976157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 19138853976091 and 19138853976100.
It is not a weakly prime, because it can be changed into another prime (19138853976461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9569426988080 + 9569426988081.
It is an arithmetic number, because the mean of its divisors is an integer number (9569426988081).
Almost surely, 219138853976161 is an apocalyptic number.
It is an amenable number.
19138853976161 is a deficient number, since it is larger than the sum of its proper divisors (1).
19138853976161 is an equidigital number, since it uses as much as digits as its factorization.
19138853976161 is an evil number, because the sum of its binary digits is even.
The product of its digits is 58786560, while the sum is 68.
The spelling of 19138853976161 in words is "nineteen trillion, one hundred thirty-eight billion, eight hundred fifty-three million, nine hundred seventy-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •