Base | Representation |
---|---|
bin | 111100010101010… |
… | …001110110110101 |
3 | 2121112122122121221 |
4 | 330111101312311 |
5 | 4033111224000 |
6 | 244235110341 |
7 | 34040436562 |
oct | 7425216665 |
9 | 2545578557 |
10 | 1012211125 |
11 | 47a404222 |
12 | 242ba23b1 |
13 | 1319242c3 |
14 | 98609869 |
15 | 5dce461a |
hex | 3c551db5 |
1012211125 has 16 divisors (see below), whose sum is σ = 1283958000. Its totient is φ = 796488000.
The previous prime is 1012211107. The next prime is 1012211131. The reversal of 1012211125 is 5211122101.
It can be written as a sum of positive squares in 8 ways, for example, as 462121009 + 550090116 = 21497^2 + 23454^2 .
It is a de Polignac number, because none of the positive numbers 2k-1012211125 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012211099 and 1012211108.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 58750 + ... + 73999.
It is an arithmetic number, because the mean of its divisors is an integer number (80247375).
Almost surely, 21012211125 is an apocalyptic number.
It is an amenable number.
1012211125 is a deficient number, since it is larger than the sum of its proper divisors (271746875).
1012211125 is an equidigital number, since it uses as much as digits as its factorization.
1012211125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132825 (or 132815 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 16.
The square root of 1012211125 is about 31815.2655968797. The cubic root of 1012211125 is about 1004.0539185368.
Adding to 1012211125 its reverse (5211122101), we get a palindrome (6223333226).
The spelling of 1012211125 in words is "one billion, twelve million, two hundred eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •