Base | Representation |
---|---|
bin | 10000001011111011100… |
… | …001001001000001111011 |
3 | 10221100002120211020210022 |
4 | 100023323201021001323 |
5 | 121211013230100243 |
6 | 2210554322241055 |
7 | 143235234213206 |
oct | 20137341110173 |
9 | 3840076736708 |
10 | 1112321331323 |
11 | 399807436644 |
12 | 15b6aa1b618b |
13 | 80b78698c77 |
14 | 3bb9da4c93d |
15 | 1de02545b68 |
hex | 102fb84907b |
1112321331323 has 2 divisors, whose sum is σ = 1112321331324. Its totient is φ = 1112321331322.
The previous prime is 1112321331293. The next prime is 1112321331337. The reversal of 1112321331323 is 3231331232111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1112321331323 - 28 = 1112321331067 is a prime.
It is a super-2 number, since 2×11123213313232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1112321331292 and 1112321331301.
It is not a weakly prime, because it can be changed into another prime (1112321331353) 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, 556160665661 + 556160665662.
It is an arithmetic number, because the mean of its divisors is an integer number (556160665662).
Almost surely, 21112321331323 is an apocalyptic number.
1112321331323 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112321331323 is an equidigital number, since it uses as much as digits as its factorization.
1112321331323 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1944, while the sum is 26.
Adding to 1112321331323 its reverse (3231331232111), we get a palindrome (4343652563434).
The spelling of 1112321331323 in words is "one trillion, one hundred twelve billion, three hundred twenty-one million, three hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •