Base | Representation |
---|---|
bin | 11110000011111100000110… |
… | …00100000001001101010000 |
3 | 22200001200020121212200220121 |
4 | 33001332003010001031100 |
5 | 32131040132333142202 |
6 | 352332410141520024 |
7 | 16632001211133253 |
oct | 1701760304011520 |
9 | 280050217780817 |
10 | 66106040521552 |
11 | 1a077461547929 |
12 | 74b7963273014 |
13 | 2ab6a08003815 |
14 | 124779990309a |
15 | 799883214537 |
hex | 3c1f83101350 |
66106040521552 has 80 divisors (see below), whose sum is σ = 135236118620160. Its totient is φ = 31217235221376.
The previous prime is 66106040521537. The next prime is 66106040521561. The reversal of 66106040521552 is 25512504060166.
It is a junction number, because it is equal to n+sod(n) for n = 66106040521499 and 66106040521508.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136969203 + ... + 137450989.
It is an arithmetic number, because the mean of its divisors is an integer number (1690451482752).
Almost surely, 266106040521552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66106040521552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67618059310080).
66106040521552 is an abundant number, since it is smaller than the sum of its proper divisors (69130078098608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66106040521552 is a wasteful number, since it uses less digits than its factorization.
66106040521552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 483200 (or 483194 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 43.
The spelling of 66106040521552 in words is "sixty-six trillion, one hundred six billion, forty million, five hundred twenty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •