Base | Representation |
---|---|
bin | 10010100110100010… |
… | …100100011101001111 |
3 | 1220120000111202100122 |
4 | 102212202210131033 |
5 | 311401312334023 |
6 | 13101555015155 |
7 | 1304654524142 |
oct | 224642443517 |
9 | 56500452318 |
10 | 19973949263 |
11 | 851a856794 |
12 | 3a5529a4bb |
13 | 1b641863b8 |
14 | d76a64059 |
15 | 7bd8222c8 |
hex | 4a68a474f |
19973949263 has 2 divisors, whose sum is σ = 19973949264. Its totient is φ = 19973949262.
The previous prime is 19973949209. The next prime is 19973949301. The reversal of 19973949263 is 36294937991.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 19973949263 - 26 = 19973949199 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 19973949196 and 19973949205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19973940263) 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, 9986974631 + 9986974632.
It is an arithmetic number, because the mean of its divisors is an integer number (9986974632).
Almost surely, 219973949263 is an apocalyptic number.
19973949263 is a deficient number, since it is larger than the sum of its proper divisors (1).
19973949263 is an equidigital number, since it uses as much as digits as its factorization.
19973949263 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19840464, while the sum is 62.
The spelling of 19973949263 in words is "nineteen billion, nine hundred seventy-three million, nine hundred forty-nine thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •