Base | Representation |
---|---|
bin | 10010100000001011… |
… | …000001111110000001 |
3 | 1220021120111000211122 |
4 | 102200023001332001 |
5 | 311141440143033 |
6 | 13043221122025 |
7 | 1302216460136 |
oct | 224013017601 |
9 | 56246430748 |
10 | 19867115393 |
11 | 8475517934 |
12 | 3a25559315 |
13 | 1b47cbc1a8 |
14 | d667b458d |
15 | 7b426ca98 |
hex | 4a02c1f81 |
19867115393 has 2 divisors, whose sum is σ = 19867115394. Its totient is φ = 19867115392.
The previous prime is 19867115383. The next prime is 19867115441. The reversal of 19867115393 is 39351176891.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13769379649 + 6097735744 = 117343^2 + 78088^2 .
It is a cyclic number.
It is not a de Polignac number, because 19867115393 - 224 = 19850338177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (19867115383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9933557696 + 9933557697.
It is an arithmetic number, because the mean of its divisors is an integer number (9933557697).
Almost surely, 219867115393 is an apocalyptic number.
It is an amenable number.
19867115393 is a deficient number, since it is larger than the sum of its proper divisors (1).
19867115393 is an equidigital number, since it uses as much as digits as its factorization.
19867115393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1224720, while the sum is 53.
The spelling of 19867115393 in words is "nineteen billion, eight hundred sixty-seven million, one hundred fifteen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •