Base | Representation |
---|---|
bin | 111110001010000011… |
… | …101110001010000100 |
3 | 20101021021110220200200 |
4 | 332022003232022010 |
5 | 2043141112200430 |
6 | 50354341410500 |
7 | 4551616636032 |
oct | 761203561204 |
9 | 211237426620 |
10 | 66740740740 |
11 | 26339454383 |
12 | 10b27409a30 |
13 | 63a812b08b |
14 | 3331c03552 |
15 | 1b09409460 |
hex | f8a0ee284 |
66740740740 has 72 divisors (see below), whose sum is σ = 202467964608. Its totient is φ = 17795680320.
The previous prime is 66740740739. The next prime is 66740740741. The reversal of 66740740740 is 4704704766.
It is an interprime number because it is at equal distance from previous prime (66740740739) and next prime (66740740741).
It is a Harshad number since it is a multiple of its sum of digits (45).
66740740740 is a modest number, since divided by 740740 gives 66740 as remainder.
It is not an unprimeable number, because it can be changed into a prime (66740740741) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3296689 + ... + 3316871.
It is an arithmetic number, because the mean of its divisors is an integer number (2812055064).
Almost surely, 266740740740 is an apocalyptic number.
66740740740 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
66740740740 is an abundant number, since it is smaller than the sum of its proper divisors (135727223868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66740740740 is a wasteful number, since it uses less digits than its factorization.
66740740740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38569 (or 38564 counting only the distinct ones).
The product of its (nonzero) digits is 790272, while the sum is 45.
The spelling of 66740740740 in words is "sixty-six billion, seven hundred forty million, seven hundred forty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •