Base | Representation |
---|---|
bin | 10010111011001101… |
… | …000100011101110001 |
3 | 1221110011212012102101 |
4 | 102323031010131301 |
5 | 313104040302422 |
6 | 13200221420401 |
7 | 1316364355024 |
oct | 227315043561 |
9 | 57404765371 |
10 | 20320634737 |
11 | 8688517707 |
12 | 3b3140a701 |
13 | 1bbac4ba30 |
14 | daab0b1bb |
15 | 7ddea3c27 |
hex | 4bb344771 |
20320634737 has 8 divisors (see below), whose sum is σ = 22043497896. Its totient is φ = 18620591232.
The previous prime is 20320634731. The next prime is 20320634749. The reversal of 20320634737 is 73743602302.
It can be written as a sum of positive squares in 4 ways, for example, as 605947456 + 19714687281 = 24616^2 + 140409^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20320634737 is a prime.
It is a super-2 number, since 2×203206347372 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20320634696 and 20320634705.
It is not an unprimeable number, because it can be changed into a prime (20320634731) 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, 5703058 + ... + 5706619.
It is an arithmetic number, because the mean of its divisors is an integer number (2755437237).
Almost surely, 220320634737 is an apocalyptic number.
It is an amenable number.
20320634737 is a deficient number, since it is larger than the sum of its proper divisors (1722863159).
20320634737 is a wasteful number, since it uses less digits than its factorization.
20320634737 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11409827.
The product of its (nonzero) digits is 127008, while the sum is 37.
The spelling of 20320634737 in words is "twenty billion, three hundred twenty million, six hundred thirty-four thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •