Base | Representation |
---|---|
bin | 110000011100000… |
… | …0001100100011001 |
3 | 11012021021202101121 |
4 | 1200320001210121 |
5 | 11312034033400 |
6 | 425135445241 |
7 | 55163546464 |
oct | 14070014431 |
9 | 4167252347 |
10 | 1625299225 |
11 | 764491400 |
12 | 394386821 |
13 | 1cb953224 |
14 | 115bdc2db |
15 | 97a4a21a |
hex | 60e01919 |
1625299225 has 27 divisors (see below), whose sum is σ = 2218268829. Its totient is φ = 1180423200.
The previous prime is 1625299213. The next prime is 1625299237. The reversal of 1625299225 is 5229925261.
The square root of 1625299225 is 40315.
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 (1625299213) and next prime (1625299237).
It can be written as a sum of positive squares in 4 ways, for example, as 367603929 + 1257695296 = 19173^2 + 35464^2 .
It is not a de Polignac number, because 1625299225 - 29 = 1625298713 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 (11) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2216959 + ... + 2217691.
Almost surely, 21625299225 is an apocalyptic number.
1625299225 is the 40315-th square number.
1625299225 is the 20158-th centered octagonal number.
It is an amenable number.
1625299225 is a deficient number, since it is larger than the sum of its proper divisors (592969604).
1625299225 is an frugal number, since it uses more digits than its factorization.
1625299225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1498 (or 749 counting only the distinct ones).
The product of its digits is 194400, while the sum is 43.
The cubic root of 1625299225 is about 1175.7395012902.
The spelling of 1625299225 in words is "one billion, six hundred twenty-five million, two hundred ninety-nine thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •