Base | Representation |
---|---|
bin | 111110000000001011… |
… | …011011011110100000 |
3 | 20100211201120212100100 |
4 | 332000023123132200 |
5 | 2042321144123331 |
6 | 50330101022400 |
7 | 4544535033321 |
oct | 760013333640 |
9 | 210751525310 |
10 | 66574989216 |
11 | 2626393384a |
12 | 10a9b9b4a00 |
13 | 637c9a5758 |
14 | 3317bb8448 |
15 | 1ae9ab7ae6 |
hex | f802db7a0 |
66574989216 has 72 divisors (see below), whose sum is σ = 192894794820. Its totient is φ = 21772947456.
The previous prime is 66574989211. The next prime is 66574989241. The reversal of 66574989216 is 61298947566.
66574989216 is a `hidden beast` number, since 6 + 6 + 57 + 498 + 92 + 1 + 6 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 58438227600 + 8136761616 = 241740^2 + 90204^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×665749892162 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (66574989211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2165521 + ... + 2196048.
Almost surely, 266574989216 is an apocalyptic number.
It is an amenable number.
66574989216 is an abundant number, since it is smaller than the sum of its proper divisors (126319805604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66574989216 is a wasteful number, since it uses less digits than its factorization.
66574989216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4361638 (or 4361627 counting only the distinct ones).
The product of its digits is 39191040, while the sum is 63.
The spelling of 66574989216 in words is "sixty-six billion, five hundred seventy-four million, nine hundred eighty-nine thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •