Base | Representation |
---|---|
bin | 111110010100010111… |
… | …001000000000000000 |
3 | 20101201022202001022112 |
4 | 332110113020000000 |
5 | 2044014340140423 |
6 | 50423434354452 |
7 | 4556116132301 |
oct | 762427100000 |
9 | 211638661275 |
10 | 66913599488 |
11 | 26417a8974a |
12 | 10b7528ba28 |
13 | 6404ba1668 |
14 | 334ab5c7a8 |
15 | 1b196a1a78 |
hex | f945c8000 |
66913599488 has 48 divisors (see below), whose sum is σ = 133918871985. Its totient is φ = 33433387008.
The previous prime is 66913599461. The next prime is 66913599509. The reversal of 66913599488 is 88499531966.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 50233360384 + 16680239104 = 224128^2 + 129152^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=182912.
It is a super-3 number, since 3×669135994883 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 46824758 + ... + 46826186.
Almost surely, 266913599488 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 66913599488
66913599488 is an abundant number, since it is smaller than the sum of its proper divisors (67005272497).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66913599488 is an frugal number, since it uses more digits than its factorization.
66913599488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2888 (or 1431 counting only the distinct ones).
The product of its digits is 100776960, while the sum is 68.
The spelling of 66913599488 in words is "sixty-six billion, nine hundred thirteen million, five hundred ninety-nine thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •