Base | Representation |
---|---|
bin | 111110000111101… |
… | …110010010100101 |
3 | 2200122002212002122 |
4 | 332013232102211 |
5 | 4113301241010 |
6 | 251230115325 |
7 | 34553440652 |
oct | 7607562245 |
9 | 2618085078 |
10 | 1042212005 |
11 | 49533533a |
12 | 25104bb45 |
13 | 137bc97c3 |
14 | 9c5b8c29 |
15 | 6176d855 |
hex | 3e1ee4a5 |
1042212005 has 16 divisors (see below), whose sum is σ = 1325343600. Its totient is φ = 785379840.
The previous prime is 1042211977. The next prime is 1042212007. The reversal of 1042212005 is 5002122401.
It can be written as a sum of positive squares in 8 ways, for example, as 245674276 + 796537729 = 15674^2 + 28223^2 .
It is not a de Polignac number, because 1042212005 - 28 = 1042211749 is a prime.
It is a super-2 number, since 2×10422120052 = 2172411726732240050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042212007) 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 15 ways as a sum of consecutive naturals, for example, 81710 + ... + 93599.
It is an arithmetic number, because the mean of its divisors is an integer number (82833975).
Almost surely, 21042212005 is an apocalyptic number.
It is an amenable number.
1042212005 is a deficient number, since it is larger than the sum of its proper divisors (283131595).
1042212005 is a wasteful number, since it uses less digits than its factorization.
1042212005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175384.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 1042212005 is about 32283.3084580871. The cubic root of 1042212005 is about 1013.8772008221.
Adding to 1042212005 its reverse (5002122401), we get a palindrome (6044334406).
The spelling of 1042212005 in words is "one billion, forty-two million, two hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •