Base | Representation |
---|---|
bin | 1001000111001001010110… |
… | …10111011110100100100011 |
3 | 2121221111100120002110220122 |
4 | 10203210223113132210203 |
5 | 10111240231000320114 |
6 | 110340431134230455 |
7 | 4135415225661044 |
oct | 443445327364443 |
9 | 77844316073818 |
10 | 20036750010659 |
11 | 64255a1029a78 |
12 | 22b730b05542b |
13 | b245c3c44185 |
14 | 4d3ad8d4a8cb |
15 | 24b306397e8e |
hex | 12392b5de923 |
20036750010659 has 4 divisors (see below), whose sum is σ = 20318957757360. Its totient is φ = 19754542263960.
The previous prime is 20036750010593. The next prime is 20036750010661. The reversal of 20036750010659 is 95601005763002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20036750010659 - 240 = 18937238382883 is a prime.
It is a super-2 number, since 2×200367500106592 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20036750010679) 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, 141103873244 + ... + 141103873385.
It is an arithmetic number, because the mean of its divisors is an integer number (5079739439340).
Almost surely, 220036750010659 is an apocalyptic number.
20036750010659 is a deficient number, since it is larger than the sum of its proper divisors (282207746701).
20036750010659 is an equidigital number, since it uses as much as digits as its factorization.
20036750010659 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282207746700.
The product of its (nonzero) digits is 340200, while the sum is 44.
The spelling of 20036750010659 in words is "twenty trillion, thirty-six billion, seven hundred fifty million, ten thousand, six hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •