Base | Representation |
---|---|
bin | 10010110000010000… |
… | …001110111011010001 |
3 | 1220222101011020211101 |
4 | 102300100032323101 |
5 | 312220022232031 |
6 | 13130055544401 |
7 | 1312003643644 |
oct | 226020167321 |
9 | 56871136741 |
10 | 20136914641 |
11 | 85a3844018 |
12 | 3a9b98b101 |
13 | 1b8bb7480c |
14 | d90565a5b |
15 | 7cccb3361 |
hex | 4b040eed1 |
20136914641 has 8 divisors (see below), whose sum is σ = 20298696704. Its totient is φ = 19975183200.
The previous prime is 20136914599. The next prime is 20136914653. The reversal of 20136914641 is 14641963102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20136914641 - 29 = 20136914129 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20136914641.
It is not an unprimeable number, because it can be changed into a prime (20136984641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1591741 + ... + 1604341.
It is an arithmetic number, because the mean of its divisors is an integer number (2537337088).
Almost surely, 220136914641 is an apocalyptic number.
It is an amenable number.
20136914641 is a deficient number, since it is larger than the sum of its proper divisors (161782063).
20136914641 is a wasteful number, since it uses less digits than its factorization.
20136914641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25311.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 20136914641 in words is "twenty billion, one hundred thirty-six million, nine hundred fourteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •