Base | Representation |
---|---|
bin | 111100110000101110… |
… | …001101101110000001 |
3 | 20020101211012110201221 |
4 | 330300232031232001 |
5 | 2032103413240000 |
6 | 45545520555041 |
7 | 4466520155164 |
oct | 746056155601 |
9 | 206354173657 |
10 | 65241930625 |
11 | 2573a407133 |
12 | 10789482a81 |
13 | 61c97645a1 |
14 | 322cb2dadb |
15 | 1a6ca4761a |
hex | f30b8db81 |
65241930625 has 45 divisors (see below), whose sum is σ = 86748419901. Its totient is φ = 49041600000.
The previous prime is 65241930623. The next prime is 65241930673. The reversal of 65241930625 is 52603914256.
The square root of 65241930625 is 255425.
It is a perfect power (a square), and thus also a powerful number.
65241930625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 22 ways, for example, as 55982872449 + 9259058176 = 236607^2 + 96224^2 .
It is not a de Polignac number, because 65241930625 - 21 = 65241930623 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65241930623) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 108555325 + ... + 108555925.
Almost surely, 265241930625 is an apocalyptic number.
65241930625 is the 255425-th square number.
65241930625 is the 127713-rd centered octagonal number.
It is an amenable number.
65241930625 is a deficient number, since it is larger than the sum of its proper divisors (21506489276).
65241930625 is an frugal number, since it uses more digits than its factorization.
65241930625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1256 (or 623 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 43.
The spelling of 65241930625 in words is "sixty-five billion, two hundred forty-one million, nine hundred thirty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •