Base | Representation |
---|---|
bin | 111101011011100… |
… | …011010010110001 |
3 | 2122211022120011201 |
4 | 331123203102301 |
5 | 4102320221000 |
6 | 250134011201 |
7 | 34353142561 |
oct | 7533432261 |
9 | 2584276151 |
10 | 1030632625 |
11 | 489846600 |
12 | 2491a6b01 |
13 | 1356a40b9 |
14 | 9ac42da1 |
15 | 6073296a |
hex | 3d6e34b1 |
1030632625 has 24 divisors (see below), whose sum is σ = 1413810216. Its totient is φ = 749540000.
The previous prime is 1030632613. The next prime is 1030632641. The reversal of 1030632625 is 5262360301.
It can be written as a sum of positive squares in 4 ways, for example, as 305515441 + 725117184 = 17479^2 + 26928^2 .
It is a de Polignac number, because none of the positive numbers 2k-1030632625 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030632593 and 1030632602.
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 23 ways as a sum of consecutive naturals, for example, 18946 + ... + 49195.
It is an arithmetic number, because the mean of its divisors is an integer number (58908759).
Almost surely, 21030632625 is an apocalyptic number.
It is an amenable number.
1030632625 is a deficient number, since it is larger than the sum of its proper divisors (383177591).
1030632625 is an equidigital number, since it uses as much as digits as its factorization.
1030632625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68178 (or 68157 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 1030632625 is about 32103.4674918458. The cubic root of 1030632625 is about 1010.1083519348.
Adding to 1030632625 its reverse (5262360301), we get a palindrome (6292992926).
The spelling of 1030632625 in words is "one billion, thirty million, six hundred thirty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •