Base | Representation |
---|---|
bin | 111101100001101110… |
… | …111100101001010100 |
3 | 20022112010110102002000 |
4 | 331201232330221110 |
5 | 2040244414101140 |
6 | 50203253115300 |
7 | 4526063326542 |
oct | 754156745124 |
9 | 208463412060 |
10 | 66064206420 |
11 | 26021582103 |
12 | 10978928b30 |
13 | 62cac16704 |
14 | 32aa016d92 |
15 | 1ab9d1ea30 |
hex | f61bbca54 |
66064206420 has 48 divisors (see below), whose sum is σ = 205533088320. Its totient is φ = 17617121568.
The previous prime is 66064206419. The next prime is 66064206427. The reversal of 66064206420 is 2460246066.
66064206420 is a `hidden beast` number, since 6 + 6 + 0 + 6 + 4 + 2 + 0 + 642 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66064206427) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61170022 + ... + 61171101.
It is an arithmetic number, because the mean of its divisors is an integer number (4281939340).
Almost surely, 266064206420 is an apocalyptic number.
66064206420 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
66064206420 is an abundant number, since it is smaller than the sum of its proper divisors (139468881900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66064206420 is a wasteful number, since it uses less digits than its factorization.
66064206420 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122341141 (or 122341133 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 36.
It can be divided in two parts, 66064 and 206420, that added together give a square (272484 = 5222).
The spelling of 66064206420 in words is "sixty-six billion, sixty-four million, two hundred six thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •