Base | Representation |
---|---|
bin | 1001001000111101001011… |
… | …01110100111001101100111 |
3 | 2122011102212011022001222001 |
4 | 10210132211232213031213 |
5 | 10113300103201002423 |
6 | 110425153323350131 |
7 | 4143046165615216 |
oct | 444364556471547 |
9 | 78142764261861 |
10 | 20098932437863 |
11 | 6449a00423984 |
12 | 2307383982347 |
13 | b2a42388c2b6 |
14 | 4d6b175c507d |
15 | 24cc454e5cad |
hex | 1247a5ba7367 |
20098932437863 has 2 divisors, whose sum is σ = 20098932437864. Its totient is φ = 20098932437862.
The previous prime is 20098932437839. The next prime is 20098932437867. The reversal of 20098932437863 is 36873423989002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20098932437863 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20098932437795 and 20098932437804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20098932437867) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10049466218931 + 10049466218932.
It is an arithmetic number, because the mean of its divisors is an integer number (10049466218932).
Almost surely, 220098932437863 is an apocalyptic number.
20098932437863 is a deficient number, since it is larger than the sum of its proper divisors (1).
20098932437863 is an equidigital number, since it uses as much as digits as its factorization.
20098932437863 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 94058496, while the sum is 64.
The spelling of 20098932437863 in words is "twenty trillion, ninety-eight billion, nine hundred thirty-two million, four hundred thirty-seven thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •