Base | Representation |
---|---|
bin | 111101110011111101… |
… | …100011101100000000 |
3 | 20100022102220200000000 |
4 | 331303331203230000 |
5 | 2041411211314430 |
6 | 50253500000000 |
7 | 4536465625530 |
oct | 756375435400 |
9 | 210272820000 |
10 | 66370026240 |
11 | 26169171061 |
12 | 10a43230000 |
13 | 63493a149b |
14 | 32d88a34c0 |
15 | 1ad6acce60 |
hex | f73f63b00 |
66370026240 has 648 divisors, whose sum is σ = 272759454240. Its totient is φ = 15156854784.
The previous prime is 66370026221. The next prime is 66370026251. The reversal of 66370026240 is 4262007366.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (648).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 66370026195 and 66370026204.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 58785996 + ... + 58787124.
Almost surely, 266370026240 is an apocalyptic number.
66370026240 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66370026240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136379727120).
66370026240 is an abundant number, since it is smaller than the sum of its proper divisors (206389428000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66370026240 is an frugal number, since it uses more digits than its factorization.
66370026240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1181 (or 1146 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 36.
The spelling of 66370026240 in words is "sixty-six billion, three hundred seventy million, twenty-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •