Base | Representation |
---|---|
bin | 10000000001100111000… |
… | …110010000011101110011 |
3 | 10220021111101211102110212 |
4 | 100001213012100131303 |
5 | 121020320234240311 |
6 | 2201523035214335 |
7 | 142363533533114 |
oct | 20014706203563 |
9 | 3807441742425 |
10 | 1101241321331 |
11 | 395041020098 |
12 | 1595175a73ab |
13 | 7cb01009838 |
14 | 3b42c2b220b |
15 | 1d9a494ec8b |
hex | 10067190773 |
1101241321331 has 2 divisors, whose sum is σ = 1101241321332. Its totient is φ = 1101241321330.
The previous prime is 1101241321307. The next prime is 1101241321337. The reversal of 1101241321331 is 1331231421011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101241321331 is a prime.
It is a super-2 number, since 2×11012413213312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101241321297 and 1101241321306.
It is not a weakly prime, because it can be changed into another prime (1101241321337) 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, 550620660665 + 550620660666.
It is an arithmetic number, because the mean of its divisors is an integer number (550620660666).
Almost surely, 21101241321331 is an apocalyptic number.
1101241321331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101241321331 is an equidigital number, since it uses as much as digits as its factorization.
1101241321331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 1101241321331 its reverse (1331231421011), we get a palindrome (2432472742342).
The spelling of 1101241321331 in words is "one trillion, one hundred one billion, two hundred forty-one million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •