Base | Representation |
---|---|
bin | 10010010101111111… |
… | …011110100110010101 |
3 | 1212211200002110102202 |
4 | 102111333132212111 |
5 | 310314224033043 |
6 | 13014240214245 |
7 | 1265043625142 |
oct | 222577364625 |
9 | 55750073382 |
10 | 19696314773 |
11 | 83980688a3 |
12 | 399830a385 |
13 | 1b1b7b9635 |
14 | d4bc333c9 |
15 | 7a42801b8 |
hex | 495fde995 |
19696314773 has 2 divisors, whose sum is σ = 19696314774. Its totient is φ = 19696314772.
The previous prime is 19696314731. The next prime is 19696314787. The reversal of 19696314773 is 37741369691.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18240663364 + 1455651409 = 135058^2 + 38153^2 .
It is a cyclic number.
It is not a de Polignac number, because 19696314773 - 226 = 19629205909 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19696314173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9848157386 + 9848157387.
It is an arithmetic number, because the mean of its divisors is an integer number (9848157387).
Almost surely, 219696314773 is an apocalyptic number.
It is an amenable number.
19696314773 is a deficient number, since it is larger than the sum of its proper divisors (1).
19696314773 is an equidigital number, since it uses as much as digits as its factorization.
19696314773 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5143824, while the sum is 56.
The spelling of 19696314773 in words is "nineteen billion, six hundred ninety-six million, three hundred fourteen thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •