Base | Representation |
---|---|
bin | 1000110111111100111100… |
… | …10101011001010100000001 |
3 | 2120002120211111102010100001 |
4 | 10123332132111121110001 |
5 | 10024212042331201221 |
6 | 105300532013200001 |
7 | 4052614165126501 |
oct | 433763625312401 |
9 | 76076744363301 |
10 | 19514692834561 |
11 | 62441533a3721 |
12 | 22320b3190001 |
13 | ab72c6175912 |
14 | 4b6732541a01 |
15 | 23c94e0e0391 |
hex | 11bf9e559501 |
19514692834561 has 2 divisors, whose sum is σ = 19514692834562. Its totient is φ = 19514692834560.
The previous prime is 19514692834513. The next prime is 19514692834579. The reversal of 19514692834561 is 16543829641591.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11651401962225 + 7863290872336 = 3413415^2 + 2804156^2 .
It is a cyclic number.
It is not a de Polignac number, because 19514692834561 - 217 = 19514692703489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 19514692834493 and 19514692834502.
It is not a weakly prime, because it can be changed into another prime (19514692837561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9757346417280 + 9757346417281.
It is an arithmetic number, because the mean of its divisors is an integer number (9757346417281).
Almost surely, 219514692834561 is an apocalyptic number.
It is an amenable number.
19514692834561 is a deficient number, since it is larger than the sum of its proper divisors (1).
19514692834561 is an equidigital number, since it uses as much as digits as its factorization.
19514692834561 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 55987200, while the sum is 64.
The spelling of 19514692834561 in words is "nineteen trillion, five hundred fourteen billion, six hundred ninety-two million, eight hundred thirty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •