Base | Representation |
---|---|
bin | 10011001110110111… |
… | …010010111110101001 |
3 | 1222022011111122011202 |
4 | 103032313102332221 |
5 | 314243010040322 |
6 | 13253043133545 |
7 | 1330511052536 |
oct | 231667227651 |
9 | 58264448152 |
10 | 20650471337 |
11 | 883771a841 |
12 | 40039742b5 |
13 | 1c41395312 |
14 | ddc849d8d |
15 | 80ce08292 |
hex | 4cedd2fa9 |
20650471337 has 8 divisors (see below), whose sum is σ = 21276528840. Its totient is φ = 20033688960.
The previous prime is 20650471333. The next prime is 20650471343. The reversal of 20650471337 is 73317405602.
It can be written as a sum of positive squares in 4 ways, for example, as 321700096 + 20328771241 = 17936^2 + 142579^2 .
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 20650471337 - 22 = 20650471333 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 20650471337.
It is not an unprimeable number, because it can be changed into a prime (20650471333) 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, 2314262 + ... + 2323167.
It is an arithmetic number, because the mean of its divisors is an integer number (2659566105).
Almost surely, 220650471337 is an apocalyptic number.
It is an amenable number.
20650471337 is a deficient number, since it is larger than the sum of its proper divisors (626057503).
20650471337 is an equidigital number, since it uses as much as digits as its factorization.
20650471337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4637563.
The product of its (nonzero) digits is 105840, while the sum is 38.
Adding to 20650471337 its reverse (73317405602), we get a palindrome (93967876939).
The spelling of 20650471337 in words is "twenty billion, six hundred fifty million, four hundred seventy-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •