Base | Representation |
---|---|
bin | 111100110011011… |
… | …101000011010101 |
3 | 2122002112112100102 |
4 | 330303131003111 |
5 | 4042122340201 |
6 | 245120423445 |
7 | 34164613403 |
oct | 7463350325 |
9 | 2562475312 |
10 | 1020121301 |
11 | 483917261 |
12 | 245777b85 |
13 | 133463894 |
14 | 996a8473 |
15 | 5e85826b |
hex | 3ccdd0d5 |
1020121301 has 2 divisors, whose sum is σ = 1020121302. Its totient is φ = 1020121300.
The previous prime is 1020121273. The next prime is 1020121307. The reversal of 1020121301 is 1031210201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 732784900 + 287336401 = 27070^2 + 16951^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1020121301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020121307) 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, 510060650 + 510060651.
It is an arithmetic number, because the mean of its divisors is an integer number (510060651).
Almost surely, 21020121301 is an apocalyptic number.
It is an amenable number.
1020121301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020121301 is an equidigital number, since it uses as much as digits as its factorization.
1020121301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1020121301 is about 31939.3378297046. The cubic root of 1020121301 is about 1006.6626113579.
Adding to 1020121301 its reverse (1031210201), we get a palindrome (2051331502).
Subtracting 1020121301 from its reverse (1031210201), we obtain a square (11088900 = 33302).
The spelling of 1020121301 in words is "one billion, twenty million, one hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •