Base | Representation |
---|---|
bin | 1001000110001000010100… |
… | …11000011101111101111101 |
3 | 2121211011020101212212120110 |
4 | 10203010022120131331331 |
5 | 10110202230220240322 |
6 | 110312414512540233 |
7 | 4133041110205224 |
oct | 443041230357575 |
9 | 77734211785513 |
10 | 20001836883837 |
11 | 6411805524056 |
12 | 22b05a6851679 |
13 | b2121ba19153 |
14 | 4d21461b5cbb |
15 | 24a461277c0c |
hex | 12310a61df7d |
20001836883837 has 4 divisors (see below), whose sum is σ = 26669115845120. Its totient is φ = 13334557922556.
The previous prime is 20001836883767. The next prime is 20001836883841. The reversal of 20001836883837 is 73838863810002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 20001836883837 - 210 = 20001836882813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001836883137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3333639480637 + ... + 3333639480642.
It is an arithmetic number, because the mean of its divisors is an integer number (6667278961280).
Almost surely, 220001836883837 is an apocalyptic number.
It is an amenable number.
20001836883837 is a deficient number, since it is larger than the sum of its proper divisors (6667278961283).
20001836883837 is an equidigital number, since it uses as much as digits as its factorization.
20001836883837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6667278961282.
The product of its (nonzero) digits is 9289728, while the sum is 57.
The spelling of 20001836883837 in words is "twenty trillion, one billion, eight hundred thirty-six million, eight hundred eighty-three thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •