Base | Representation |
---|---|
bin | 100001011010100… |
… | …0010110010100101 |
3 | 2220010201221001201 |
4 | 1002311002302211 |
5 | 4244011420232 |
6 | 303131122501 |
7 | 36533024335 |
oct | 10265026245 |
9 | 2803657051 |
10 | 1121201317 |
11 | 525986165 |
12 | 2735a3431 |
13 | 14b394b42 |
14 | a8c9b0c5 |
15 | 68672be7 |
hex | 42d42ca5 |
1121201317 has 2 divisors, whose sum is σ = 1121201318. Its totient is φ = 1121201316.
The previous prime is 1121201311. The next prime is 1121201353. The reversal of 1121201317 is 7131021211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 579894561 + 541306756 = 24081^2 + 23266^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121201317 - 223 = 1112812709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121201294 and 1121201303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121201311) 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, 560600658 + 560600659.
It is an arithmetic number, because the mean of its divisors is an integer number (560600659).
Almost surely, 21121201317 is an apocalyptic number.
It is an amenable number.
1121201317 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121201317 is an equidigital number, since it uses as much as digits as its factorization.
1121201317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
The square root of 1121201317 is about 33484.3443567289. The cubic root of 1121201317 is about 1038.8699871871.
Adding to 1121201317 its reverse (7131021211), we get a palindrome (8252222528).
The spelling of 1121201317 in words is "one billion, one hundred twenty-one million, two hundred one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •