Base | Representation |
---|---|
bin | 100101010001011… |
… | …0001101001010001 |
3 | 10020011021121010222 |
4 | 1022202301221101 |
5 | 10030130131400 |
6 | 324033202425 |
7 | 42664116155 |
oct | 11242615121 |
9 | 3204247128 |
10 | 1250630225 |
11 | 591a47aa9 |
12 | 2aaa00415 |
13 | 16c1406b0 |
14 | bc14d065 |
15 | 74bdc185 |
hex | 4a8b1a51 |
1250630225 has 24 divisors (see below), whose sum is σ = 1688876280. Its totient is φ = 913144320.
The previous prime is 1250630207. The next prime is 1250630237. The reversal of 1250630225 is 5220360521.
It can be written as a sum of positive squares in 12 ways, for example, as 1089264016 + 161366209 = 33004^2 + 12703^2 .
It is not a de Polignac number, because 1250630225 - 28 = 1250629969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1250630194 and 1250630203.
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 23 ways as a sum of consecutive naturals, for example, 7307 + ... + 50543.
It is an arithmetic number, because the mean of its divisors is an integer number (70369845).
Almost surely, 21250630225 is an apocalyptic number.
It is an amenable number.
1250630225 is a deficient number, since it is larger than the sum of its proper divisors (438246055).
1250630225 is a wasteful number, since it uses less digits than its factorization.
1250630225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43349 (or 43344 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 1250630225 is about 35364.2506636292. The cubic root of 1250630225 is about 1077.3983517464.
Adding to 1250630225 its reverse (5220360521), we get a palindrome (6470990746).
The spelling of 1250630225 in words is "one billion, two hundred fifty million, six hundred thirty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •