Base | Representation |
---|---|
bin | 111110100111000… |
… | …011001111111001 |
3 | 2201012120002021012 |
4 | 332213003033321 |
5 | 4122402034223 |
6 | 252122123305 |
7 | 35013313361 |
oct | 7647031771 |
9 | 2635502235 |
10 | 1050424313 |
11 | 499a34374 |
12 | 253950535 |
13 | 139813763 |
14 | 9d7159a1 |
15 | 62341c78 |
hex | 3e9c33f9 |
1050424313 has 2 divisors, whose sum is σ = 1050424314. Its totient is φ = 1050424312.
The previous prime is 1050424301. The next prime is 1050424321. The reversal of 1050424313 is 3134240501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 966463744 + 83960569 = 31088^2 + 9163^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050424313 - 210 = 1050423289 is a prime.
It is a super-2 number, since 2×10504243132 = 2206782474683043938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1050424343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525212156 + 525212157.
It is an arithmetic number, because the mean of its divisors is an integer number (525212157).
Almost surely, 21050424313 is an apocalyptic number.
It is an amenable number.
1050424313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050424313 is an equidigital number, since it uses as much as digits as its factorization.
1050424313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 1050424313 is about 32410.2501224535. The cubic root of 1050424313 is about 1016.5332495473.
Adding to 1050424313 its reverse (3134240501), we get a palindrome (4184664814).
The spelling of 1050424313 in words is "one billion, fifty million, four hundred twenty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •