Base | Representation |
---|---|
bin | 11110010111000000000111… |
… | …11000001110100110101001 |
3 | 22202101021220102210010121010 |
4 | 33023200003320032212221 |
5 | 32222303100400024203 |
6 | 353553332531334133 |
7 | 20030216504021010 |
oct | 1713400370164651 |
9 | 282337812703533 |
10 | 66761036720553 |
11 | 1a2aa21885475a |
12 | 75a28a0151349 |
13 | 2b3370082b4c6 |
14 | 126b373c69a77 |
15 | 7ab91b37c303 |
hex | 3cb803e0e9a9 |
66761036720553 has 32 divisors (see below), whose sum is σ = 103896399200256. Its totient is φ = 37337190545088.
The previous prime is 66761036720509. The next prime is 66761036720561. The reversal of 66761036720553 is 35502763016766.
It is not a de Polignac number, because 66761036720553 - 214 = 66761036704169 is a prime.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 66761036720493 and 66761036720502.
It is not an unprimeable number, because it can be changed into a prime (66761036720353) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 229137475 + ... + 229428647.
It is an arithmetic number, because the mean of its divisors is an integer number (3246762475008).
Almost surely, 266761036720553 is an apocalyptic number.
It is an amenable number.
66761036720553 is a deficient number, since it is larger than the sum of its proper divisors (37135362479703).
66761036720553 is a wasteful number, since it uses less digits than its factorization.
66761036720553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 523533.
The product of its (nonzero) digits is 28576800, while the sum is 57.
The spelling of 66761036720553 in words is "sixty-six trillion, seven hundred sixty-one billion, thirty-six million, seven hundred twenty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •