Base | Representation |
---|---|
bin | 10011010010010001… |
… | …010000000001111010 |
3 | 1222110011000102002110 |
4 | 103102101100001322 |
5 | 314402121403100 |
6 | 13302443513150 |
7 | 1332103516023 |
oct | 232221200172 |
9 | 58404012073 |
10 | 20707606650 |
11 | 88669a4405 |
12 | 401ab287b6 |
13 | 1c5017b3b3 |
14 | 100627dc4a |
15 | 812e42250 |
hex | 4d245007a |
20707606650 has 48 divisors (see below), whose sum is σ = 51370444224. Its totient is φ = 5520353280.
The previous prime is 20707606649. The next prime is 20707606651. The reversal of 20707606650 is 5660670702.
It is an interprime number because it is at equal distance from previous prime (20707606649) and next prime (20707606651).
It is a super-2 number, since 2×207076066502 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20707606599 and 20707606608.
It is not an unprimeable number, because it can be changed into a prime (20707606651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 521914 + ... + 560186.
It is an arithmetic number, because the mean of its divisors is an integer number (1070217588).
Almost surely, 220707606650 is an apocalyptic number.
20707606650 is an abundant number, since it is smaller than the sum of its proper divisors (30662837574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20707606650 is a wasteful number, since it uses less digits than its factorization.
20707606650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41895 (or 41890 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 39.
The spelling of 20707606650 in words is "twenty billion, seven hundred seven million, six hundred six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •