Base | Representation |
---|---|
bin | 10000010100010010111… |
… | …000101101101011001101 |
3 | 10222012021120000121200111 |
4 | 100110102320231223031 |
5 | 121332412122240133 |
6 | 2215041501400021 |
7 | 144003640653661 |
oct | 20242270555315 |
9 | 3865246017614 |
10 | 1121303321293 |
11 | 3a25a6546651 |
12 | 161396269011 |
13 | 8197a4b182c |
14 | 3c3b28d68a1 |
15 | 1e27ad661cd |
hex | 10512e2dacd |
1121303321293 has 2 divisors, whose sum is σ = 1121303321294. Its totient is φ = 1121303321292.
The previous prime is 1121303321279. The next prime is 1121303321353. The reversal of 1121303321293 is 3921233031211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 932611255524 + 188692065769 = 965718^2 + 434387^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121303321293 - 25 = 1121303321261 is a prime.
It is a super-2 number, since 2×11213033212932 (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 (1121303321273) 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, 560651660646 + 560651660647.
It is an arithmetic number, because the mean of its divisors is an integer number (560651660647).
Almost surely, 21121303321293 is an apocalyptic number.
It is an amenable number.
1121303321293 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121303321293 is an equidigital number, since it uses as much as digits as its factorization.
1121303321293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 31.
The spelling of 1121303321293 in words is "one trillion, one hundred twenty-one billion, three hundred three million, three hundred twenty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •