Base | Representation |
---|---|
bin | 1000110001100011010010… |
… | …11011001000011100100001 |
3 | 2112022120011010101200022021 |
4 | 10120301221123020130201 |
5 | 10012111133011020133 |
6 | 105011520300141441 |
7 | 4031000120241304 |
oct | 430615133103441 |
9 | 75276133350267 |
10 | 19294761813793 |
11 | 6169954037634 |
12 | 21b7554837881 |
13 | a9c646850b3b |
14 | 4a9c2b3b2b3b |
15 | 236d7aec852d |
hex | 118c696c8721 |
19294761813793 has 2 divisors, whose sum is σ = 19294761813794. Its totient is φ = 19294761813792.
The previous prime is 19294761813713. The next prime is 19294761813823. The reversal of 19294761813793 is 39731816749291.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11683387101409 + 7611374712384 = 3418097^2 + 2758872^2 .
It is an emirp because it is prime and its reverse (39731816749291) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 19294761813793 - 225 = 19294728259361 is a prime.
It is not a weakly prime, because it can be changed into another prime (19294761813713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9647380906896 + 9647380906897.
It is an arithmetic number, because the mean of its divisors is an integer number (9647380906897).
Almost surely, 219294761813793 is an apocalyptic number.
It is an amenable number.
19294761813793 is a deficient number, since it is larger than the sum of its proper divisors (1).
19294761813793 is an equidigital number, since it uses as much as digits as its factorization.
19294761813793 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 123451776, while the sum is 70.
The spelling of 19294761813793 in words is "nineteen trillion, two hundred ninety-four billion, seven hundred sixty-one million, eight hundred thirteen thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •