Base | Representation |
---|---|
bin | 1000101101000110111111… |
… | …01110100100011000000001 |
3 | 2111202222011210120021201101 |
4 | 10112203133232210120001 |
5 | 10002111034204012021 |
6 | 104413434435334401 |
7 | 4013654525433103 |
oct | 426433756443001 |
9 | 74688153507641 |
10 | 19142127797761 |
11 | 6110149120231 |
12 | 2191a57a51401 |
13 | a8b13067b817 |
14 | 4a26abc87573 |
15 | 232de6049a91 |
hex | 1168dfba4601 |
19142127797761 has 2 divisors, whose sum is σ = 19142127797762. Its totient is φ = 19142127797760.
The previous prime is 19142127797753. The next prime is 19142127797797. The reversal of 19142127797761 is 16779772124191.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12806556890625 + 6335570907136 = 3578625^2 + 2517056^2 .
It is a cyclic number.
It is not a de Polignac number, because 19142127797761 - 23 = 19142127797753 is a prime.
It is a super-2 number, since 2×191421277977612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 19142127797693 and 19142127797702.
It is not a weakly prime, because it can be changed into another prime (19142127707761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9571063898880 + 9571063898881.
It is an arithmetic number, because the mean of its divisors is an integer number (9571063898881).
Almost surely, 219142127797761 is an apocalyptic number.
It is an amenable number.
19142127797761 is a deficient number, since it is larger than the sum of its proper divisors (1).
19142127797761 is an equidigital number, since it uses as much as digits as its factorization.
19142127797761 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18670176, while the sum is 64.
The spelling of 19142127797761 in words is "nineteen trillion, one hundred forty-two billion, one hundred twenty-seven million, seven hundred ninety-seven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •