Base | Representation |
---|---|
bin | 10011001001011110… |
… | …110001010111110001 |
3 | 1222001212120011000122 |
4 | 103021132301113301 |
5 | 314101344444040 |
6 | 13240055300025 |
7 | 1325333305124 |
oct | 231136612761 |
9 | 58055504018 |
10 | 20560156145 |
11 | 87a0743691 |
12 | 3b9967a615 |
13 | 1c28762a89 |
14 | dd085a3bb |
15 | 8050181b5 |
hex | 4c97b15f1 |
20560156145 has 8 divisors (see below), whose sum is σ = 24675390504. Its totient is φ = 16445989504.
The previous prime is 20560156117. The next prime is 20560156147. The reversal of 20560156145 is 54165106502.
It can be written as a sum of positive squares in 4 ways, for example, as 1242492001 + 19317664144 = 35249^2 + 138988^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 20560156145 - 26 = 20560156081 is a prime.
It is a super-2 number, since 2×205601561452 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20560156147) 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 7 ways as a sum of consecutive naturals, for example, 223934 + ... + 302103.
It is an arithmetic number, because the mean of its divisors is an integer number (3084423813).
Almost surely, 220560156145 is an apocalyptic number.
It is an amenable number.
20560156145 is a deficient number, since it is larger than the sum of its proper divisors (4115234359).
20560156145 is an equidigital number, since it uses as much as digits as its factorization.
20560156145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533859.
The product of its (nonzero) digits is 36000, while the sum is 35.
The spelling of 20560156145 in words is "twenty billion, five hundred sixty million, one hundred fifty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •