Base | Representation |
---|---|
bin | 10001111000100010… |
… | …01000110110000001 |
3 | 220210010002101122011 |
4 | 20330101020312001 |
5 | 124130332411400 |
6 | 4224412012521 |
7 | 456631444141 |
oct | 107421106601 |
9 | 26703071564 |
10 | 9601060225 |
11 | 4087603719 |
12 | 1a3b461141 |
13 | ba015a633 |
14 | 671196921 |
15 | 3b2d588ba |
hex | 23c448d81 |
9601060225 has 9 divisors (see below), whose sum is σ = 11905922217. Its totient is φ = 7680456240.
The previous prime is 9601060213. The next prime is 9601060237. The reversal of 9601060225 is 5220601069.
The square root of 9601060225 is 97985.
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 (9601060213) and next prime (9601060237).
It can be written as a sum of positive squares in 4 ways, for example, as 626150529 + 8974909696 = 25023^2 + 94736^2 .
It is not a de Polignac number, because 9601060225 - 211 = 9601058177 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 (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 480127 + ... + 499723.
Almost surely, 29601060225 is an apocalyptic number.
9601060225 is the 97985-th square number.
9601060225 is the 48993-rd centered octagonal number.
It is an amenable number.
9601060225 is a deficient number, since it is larger than the sum of its proper divisors (2304861992).
9601060225 is an frugal number, since it uses more digits than its factorization.
9601060225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39204 (or 19602 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The cubic root of 9601060225 is about 2125.3953755672.
The spelling of 9601060225 in words is "nine billion, six hundred one million, sixty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •