Base | Representation |
---|---|
bin | 11110000001100100011111… |
… | …11111100000111101001111 |
3 | 22122202220011121000120210022 |
4 | 33000302033333200331033 |
5 | 32123221442141103223 |
6 | 352231150142132355 |
7 | 16623060311154026 |
oct | 1700621777407517 |
9 | 278686147016708 |
10 | 66024653066063 |
11 | 1a04599743aa1a |
12 | 74a402a8810bb |
13 | 2aac1375c3033 |
14 | 124387879d8bd |
15 | 7976bd02cac8 |
hex | 3c0c8ffe0f4f |
66024653066063 has 8 divisors (see below), whose sum is σ = 66133765441920. Its totient is φ = 65915548591320.
The previous prime is 66024653066059. The next prime is 66024653066069. The reversal of 66024653066063 is 36066035642066.
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 66024653066063 - 22 = 66024653066059 is a prime.
It is a super-3 number, since 3×660246530660633 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66024653065996 and 66024653066014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66024653066069) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14869856 + ... + 18792602.
It is an arithmetic number, because the mean of its divisors is an integer number (8266720680240).
Almost surely, 266024653066063 is an apocalyptic number.
66024653066063 is a deficient number, since it is larger than the sum of its proper divisors (109112375857).
66024653066063 is a wasteful number, since it uses less digits than its factorization.
66024653066063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3950557.
The product of its (nonzero) digits is 16796160, while the sum is 53.
The spelling of 66024653066063 in words is "sixty-six trillion, twenty-four billion, six hundred fifty-three million, sixty-six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •