Base | Representation |
---|---|
bin | 11110100100100010111… |
… | …11101011010010001111 |
3 | 10201102022002102012110011 |
4 | 33102101133223102033 |
5 | 114202221213122203 |
6 | 2122315244254051 |
7 | 135614133232423 |
oct | 17222137532217 |
9 | 3642262365404 |
10 | 1050413020303 |
11 | 375528847239 |
12 | 14b6b1241327 |
13 | 7809078837a |
14 | 38ba996ab83 |
15 | 1c4cc4e276d |
hex | f4917eb48f |
1050413020303 has 2 divisors, whose sum is σ = 1050413020304. Its totient is φ = 1050413020302.
The previous prime is 1050413020297. The next prime is 1050413020309. The reversal of 1050413020303 is 3030203140501.
It is a balanced prime because it is at equal distance from previous prime (1050413020297) and next prime (1050413020309).
It is a cyclic number.
It is not a de Polignac number, because 1050413020303 - 225 = 1050379465871 is a prime.
It is a super-2 number, since 2×10504130203032 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050413020309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525206510151 + 525206510152.
It is an arithmetic number, because the mean of its divisors is an integer number (525206510152).
Almost surely, 21050413020303 is an apocalyptic number.
1050413020303 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050413020303 is an equidigital number, since it uses as much as digits as its factorization.
1050413020303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 1050413020303 its reverse (3030203140501), we get a palindrome (4080616160804).
The spelling of 1050413020303 in words is "one trillion, fifty billion, four hundred thirteen million, twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •