Base | Representation |
---|---|
bin | 10011000100100111… |
… | …101100111011011001 |
3 | 1221212012010020100001 |
4 | 103010213230323121 |
5 | 313420011024121 |
6 | 13224023413001 |
7 | 1323323215501 |
oct | 230447547331 |
9 | 57765106301 |
10 | 20478611161 |
11 | 8759707738 |
12 | 3b762b4161 |
13 | 1c148b13c8 |
14 | dc3ab0a01 |
15 | 7eccab991 |
hex | 4c49eced9 |
20478611161 has 4 divisors (see below), whose sum is σ = 20978089524. Its totient is φ = 19979132800.
The previous prime is 20478611159. The next prime is 20478611183. The reversal of 20478611161 is 16111687402.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10729023561 + 9749587600 = 103581^2 + 98740^2 .
It is a cyclic number.
It is not a de Polignac number, because 20478611161 - 21 = 20478611159 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 20478611161.
It is not an unprimeable number, because it can be changed into a prime (20478611561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 249739120 + ... + 249739201.
It is an arithmetic number, because the mean of its divisors is an integer number (5244522381).
Almost surely, 220478611161 is an apocalyptic number.
It is an amenable number.
20478611161 is a deficient number, since it is larger than the sum of its proper divisors (499478363).
20478611161 is an equidigital number, since it uses as much as digits as its factorization.
20478611161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499478362.
The product of its (nonzero) digits is 16128, while the sum is 37.
The spelling of 20478611161 in words is "twenty billion, four hundred seventy-eight million, six hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •