Base | Representation |
---|---|
bin | 10010010101011101… |
… | …101100001001001101 |
3 | 1212211001102110100022 |
4 | 102111131230021031 |
5 | 310304442113412 |
6 | 13013322311525 |
7 | 1264605424601 |
oct | 222535541115 |
9 | 55731373308 |
10 | 19687457357 |
11 | 8393069117 |
12 | 39953585a5 |
13 | 1b19a07b69 |
14 | d4a9a9501 |
15 | 7a35d0a72 |
hex | 49576c24d |
19687457357 has 2 divisors, whose sum is σ = 19687457358. Its totient is φ = 19687457356.
The previous prime is 19687457329. The next prime is 19687457369. The reversal of 19687457357 is 75375478691.
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., 19426505641 + 260951716 = 139379^2 + 16154^2 .
It is an emirp because it is prime and its reverse (75375478691) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 19687457357 - 222 = 19683263053 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 19687457357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19687457057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9843728678 + 9843728679.
It is an arithmetic number, because the mean of its divisors is an integer number (9843728679).
Almost surely, 219687457357 is an apocalyptic number.
It is an amenable number.
19687457357 is a deficient number, since it is larger than the sum of its proper divisors (1).
19687457357 is an equidigital number, since it uses as much as digits as its factorization.
19687457357 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 44452800, while the sum is 62.
The spelling of 19687457357 in words is "nineteen billion, six hundred eighty-seven million, four hundred fifty-seven thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •