Base | Representation |
---|---|
bin | 111110100100000… |
… | …010100100110001 |
3 | 2201011001222200212 |
4 | 332210002210301 |
5 | 4122201310441 |
6 | 252053153505 |
7 | 35003515463 |
oct | 7644024461 |
9 | 2634058625 |
10 | 1049635121 |
11 | 499545447 |
12 | 25362b895 |
13 | 1395c8492 |
14 | 9d58c133 |
15 | 62237eeb |
hex | 3e902931 |
1049635121 has 2 divisors, whose sum is σ = 1049635122. Its totient is φ = 1049635120.
The previous prime is 1049635087. The next prime is 1049635123. The reversal of 1049635121 is 1215369401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 542890000 + 506745121 = 23300^2 + 22511^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1049635121 is a prime.
It is a super-2 number, since 2×10496351212 = 2203467774473369282, which contains 22 as substring.
Together with 1049635123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1049635123) by changing a digit.
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 as a sum of consecutive naturals, namely, 524817560 + 524817561.
It is an arithmetic number, because the mean of its divisors is an integer number (524817561).
Almost surely, 21049635121 is an apocalyptic number.
It is an amenable number.
1049635121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1049635121 is an equidigital number, since it uses as much as digits as its factorization.
1049635121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 1049635121 is about 32398.0727976218. The cubic root of 1049635121 is about 1016.2786093059.
The spelling of 1049635121 in words is "one billion, forty-nine million, six hundred thirty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •