Base | Representation |
---|---|
bin | 111110100110101… |
… | …000010011011101 |
3 | 2201012100110212122 |
4 | 332212220103131 |
5 | 4122340021244 |
6 | 252115512325 |
7 | 35012343536 |
oct | 7646502335 |
9 | 2635313778 |
10 | 1050313949 |
11 | 499969463 |
12 | 2538b86a5 |
13 | 1397a5459 |
14 | 9d6c768d |
15 | 6231e1ee |
hex | 3e9a84dd |
1050313949 has 2 divisors, whose sum is σ = 1050313950. Its totient is φ = 1050313948.
The previous prime is 1050313889. The next prime is 1050313951. The reversal of 1050313949 is 9493130501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 855153049 + 195160900 = 29243^2 + 13970^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050313949 - 216 = 1050248413 is a prime.
It is a super-2 number, since 2×10503139492 = 2206318782927949202, which contains 22 as substring.
Together with 1050313951, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050313049) 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 as a sum of consecutive naturals, namely, 525156974 + 525156975.
It is an arithmetic number, because the mean of its divisors is an integer number (525156975).
Almost surely, 21050313949 is an apocalyptic number.
It is an amenable number.
1050313949 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050313949 is an equidigital number, since it uses as much as digits as its factorization.
1050313949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 35.
The square root of 1050313949 is about 32408.5474682220. The cubic root of 1050313949 is about 1016.4976472345.
The spelling of 1050313949 in words is "one billion, fifty million, three hundred thirteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •