Base | Representation |
---|---|
bin | 111110010110110001… |
… | …110100000010001001 |
3 | 20101211011001020012021 |
4 | 332112301310002021 |
5 | 2044110230300100 |
6 | 50431443444441 |
7 | 4560120612400 |
oct | 762661640211 |
9 | 211734036167 |
10 | 66954150025 |
11 | 26438965994 |
12 | 10b86986721 |
13 | 64103cb969 |
14 | 33522b6637 |
15 | 1b1d011a1a |
hex | f96c74089 |
66954150025 has 27 divisors (see below), whose sum is σ = 96591010581. Its totient is φ = 45905207040.
The previous prime is 66954150019. The next prime is 66954150031. The reversal of 66954150025 is 52005145966.
The square root of 66954150025 is 258755.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (66954150019) and next prime (66954150031).
It can be written as a sum of positive squares in 4 ways, for example, as 16136366841 + 50817783184 = 127029^2 + 225428^2 .
It is not a de Polignac number, because 66954150025 - 29 = 66954149513 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 26 ways as a sum of consecutive naturals, for example, 9052729 + ... + 9060121.
Almost surely, 266954150025 is an apocalyptic number.
66954150025 is the 258755-th square number.
66954150025 is the 129378-th centered octagonal number.
It is an amenable number.
66954150025 is a deficient number, since it is larger than the sum of its proper divisors (29636860556).
66954150025 is an frugal number, since it uses more digits than its factorization.
66954150025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14810 (or 7405 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 66954150025 in words is "sixty-six billion, nine hundred fifty-four million, one hundred fifty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •