Base | Representation |
---|---|
bin | 10011001110011000011… |
… | …100011010000000100101 |
3 | 11200022000121022202221011 |
4 | 103032120130122000211 |
5 | 133121114302341034 |
6 | 2450524414422221 |
7 | 164306254222561 |
oct | 23163034320045 |
9 | 4608017282834 |
10 | 1321112543269 |
11 | 46a30a653462 |
12 | 194059b01971 |
13 | 977711250ac |
14 | 47d295166a1 |
15 | 245726a3864 |
hex | 1339871a025 |
1321112543269 has 2 divisors, whose sum is σ = 1321112543270. Its totient is φ = 1321112543268.
The previous prime is 1321112543221. The next prime is 1321112543291. The reversal of 1321112543269 is 9623452111231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1163082442369 + 158030100900 = 1078463^2 + 397530^2 .
It is a cyclic number.
It is not a de Polignac number, because 1321112543269 - 27 = 1321112543141 is a prime.
It is a super-2 number, since 2×13211125432692 (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 (1321112513269) 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, 660556271634 + 660556271635.
It is an arithmetic number, because the mean of its divisors is an integer number (660556271635).
Almost surely, 21321112543269 is an apocalyptic number.
It is an amenable number.
1321112543269 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321112543269 is an equidigital number, since it uses as much as digits as its factorization.
1321112543269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 77760, while the sum is 40.
The spelling of 1321112543269 in words is "one trillion, three hundred twenty-one billion, one hundred twelve million, five hundred forty-three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •