Base | Representation |
---|---|
bin | 1001011001100100111111… |
… | …00111011111000100001001 |
3 | 2201012001001001121120222212 |
4 | 10230302133213133010021 |
5 | 10202124241000302203 |
6 | 111543410021154505 |
7 | 4232235240542162 |
oct | 454623747370411 |
9 | 81161031546885 |
10 | 20670060556553 |
11 | 664a13a353741 |
12 | 2399bb555ba35 |
13 | b6c241a9bc65 |
14 | 51661719c769 |
15 | 25ca207c71d8 |
hex | 12cc9f9df109 |
20670060556553 has 6 divisors (see below), whose sum is σ = 20854600228254. Its totient is φ = 20487139654016.
The previous prime is 20670060556549. The next prime is 20670060556591. The reversal of 20670060556553 is 35565506007602.
It can be written as a sum of positive squares in 3 ways, for example, as 1096276009024 + 19573784547529 = 1047032^2 + 4424227^2 .
It is not a de Polignac number, because 20670060556553 - 22 = 20670060556549 is a prime.
It is a super-2 number, since 2×206700605565532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20670060556253) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 809371700 + ... + 809397237.
It is an arithmetic number, because the mean of its divisors is an integer number (3475766704709).
Almost surely, 220670060556553 is an apocalyptic number.
It is an amenable number.
20670060556553 is a deficient number, since it is larger than the sum of its proper divisors (184539671701).
20670060556553 is an equidigital number, since it uses as much as digits as its factorization.
20670060556553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1618769163 (or 1618769050 counting only the distinct ones).
The product of its (nonzero) digits is 5670000, while the sum is 50.
The spelling of 20670060556553 in words is "twenty trillion, six hundred seventy billion, sixty million, five hundred fifty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •