Base | Representation |
---|---|
bin | 10010011110010… |
… | …011111110011001 |
3 | 210121012101022001 |
4 | 102132103332121 |
5 | 1113320423100 |
6 | 50431001001 |
7 | 10452261400 |
oct | 2236237631 |
9 | 717171261 |
10 | 309936025 |
11 | 149a50583 |
12 | 87969161 |
13 | 4c2994c9 |
14 | 2d23c637 |
15 | 1c322d6a |
hex | 12793f99 |
309936025 has 27 divisors (see below), whose sum is σ = 447957471. Its totient is φ = 212105040.
The previous prime is 309936023. The next prime is 309936041. The reversal of 309936025 is 520639903.
The square root of 309936025 is 17605.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 111576969 + 198359056 = 10563^2 + 14084^2 .
It is not a de Polignac number, because 309936025 - 21 = 309936023 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (309936023) 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 26 ways as a sum of consecutive naturals, for example, 615924 + ... + 616426.
Almost surely, 2309936025 is an apocalyptic number.
309936025 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
309936025 is the 17605-th square number.
309936025 is the 8803-rd centered octagonal number.
It is an amenable number.
309936025 is a deficient number, since it is larger than the sum of its proper divisors (138021446).
309936025 is an frugal number, since it uses more digits than its factorization.
309936025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030 (or 515 counting only the distinct ones).
The product of its (nonzero) digits is 43740, while the sum is 37.
The cubic root of 309936025 is about 676.7433854090.
The spelling of 309936025 in words is "three hundred nine million, nine hundred thirty-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •