Base | Representation |
---|---|
bin | 10000010101010000001… |
… | …001110001011011110001 |
3 | 10222021221012011102201221 |
4 | 100111100021301123301 |
5 | 121342013242001223 |
6 | 2215331500425041 |
7 | 144041261552365 |
oct | 20252011613361 |
9 | 3867835142657 |
10 | 1122331203313 |
11 | 3a2a83783621 |
12 | 161622548181 |
13 | 81ab2431948 |
14 | 3c46d2212a5 |
15 | 1e2db203b5d |
hex | 105502716f1 |
1122331203313 has 2 divisors, whose sum is σ = 1122331203314. Its totient is φ = 1122331203312.
The previous prime is 1122331203311. The next prime is 1122331203421. The reversal of 1122331203313 is 3133021332211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1019429470224 + 102901733089 = 1009668^2 + 320783^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122331203313 - 21 = 1122331203311 is a prime.
Together with 1122331203311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1122331203311) 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, 561165601656 + 561165601657.
It is an arithmetic number, because the mean of its divisors is an integer number (561165601657).
Almost surely, 21122331203313 is an apocalyptic number.
It is an amenable number.
1122331203313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122331203313 is an equidigital number, since it uses as much as digits as its factorization.
1122331203313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1122331203313 its reverse (3133021332211), we get a palindrome (4255352535524).
The spelling of 1122331203313 in words is "one trillion, one hundred twenty-two billion, three hundred thirty-one million, two hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •