Base | Representation |
---|---|
bin | 11110000010011110111001… |
… | …01111111101100010111101 |
3 | 22122212220002121100121120001 |
4 | 33001033130233331202331 |
5 | 32124230144413334230 |
6 | 352253413211554301 |
7 | 16625250253305523 |
oct | 1701173457754275 |
9 | 278786077317501 |
10 | 66056005605565 |
11 | 1a0582160a6998 |
12 | 74aa11a75b991 |
13 | 2ab2092c5a361 |
14 | 12451b06c4313 |
15 | 7984057740ca |
hex | 3c13dcbfd8bd |
66056005605565 has 4 divisors (see below), whose sum is σ = 79267206726684. Its totient is φ = 52844804484448.
The previous prime is 66056005605517. The next prime is 66056005605587. The reversal of 66056005605565 is 56550650065066.
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 17771671197316 + 48284334408249 = 4215646^2 + 6948693^2 .
It is a cyclic number.
It is not a de Polignac number, because 66056005605565 - 27 = 66056005605437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6605600560552 + ... + 6605600560561.
It is an arithmetic number, because the mean of its divisors is an integer number (19816801681671).
Almost surely, 266056005605565 is an apocalyptic number.
It is an amenable number.
66056005605565 is a deficient number, since it is larger than the sum of its proper divisors (13211201121119).
66056005605565 is a wasteful number, since it uses less digits than its factorization.
66056005605565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13211201121118.
The product of its (nonzero) digits is 24300000, while the sum is 55.
The spelling of 66056005605565 in words is "sixty-six trillion, fifty-six billion, five million, six hundred five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •