Base | Representation |
---|---|
bin | 10001111111111011… |
… | …001101111010011001 |
3 | 1211212212110120000001 |
4 | 101333323031322121 |
5 | 304034440132342 |
6 | 12513413213001 |
7 | 1252630063144 |
oct | 217773157231 |
9 | 54785416001 |
10 | 19326099097 |
11 | 8218096328 |
12 | 38b4331161 |
13 | 1a8cba5ac6 |
14 | d149c305b |
15 | 781a018b7 |
hex | 47fecde99 |
19326099097 has 2 divisors, whose sum is σ = 19326099098. Its totient is φ = 19326099096.
The previous prime is 19326099073. The next prime is 19326099101. The reversal of 19326099097 is 79099062391.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15869952576 + 3456146521 = 125976^2 + 58789^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19326099097 is a prime.
It is not a weakly prime, because it can be changed into another prime (19326099797) 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, 9663049548 + 9663049549.
It is an arithmetic number, because the mean of its divisors is an integer number (9663049549).
Almost surely, 219326099097 is an apocalyptic number.
It is an amenable number.
19326099097 is a deficient number, since it is larger than the sum of its proper divisors (1).
19326099097 is an equidigital number, since it uses as much as digits as its factorization.
19326099097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1653372, while the sum is 55.
The spelling of 19326099097 in words is "nineteen billion, three hundred twenty-six million, ninety-nine thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •