Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …101101110011100111111 |
3 | 10220011112212212010102211 |
4 | 100000203011232130333 |
5 | 121011001141100302 |
6 | 2201213520001251 |
7 | 142323340346464 |
oct | 20004305563477 |
9 | 3804485763384 |
10 | 1100100331327 |
11 | 394605a59448 |
12 | 159259460227 |
13 | 7c97b80681a |
14 | 3b36094366b |
15 | 1d9396bdad7 |
hex | 1002316e73f |
1100100331327 has 2 divisors, whose sum is σ = 1100100331328. Its totient is φ = 1100100331326.
The previous prime is 1100100331241. The next prime is 1100100331367. The reversal of 1100100331327 is 7231330010011.
It is a strong prime.
It is an emirp because it is prime and its reverse (7231330010011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100100331327 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100100331298 and 1100100331307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100100331367) 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, 550050165663 + 550050165664.
It is an arithmetic number, because the mean of its divisors is an integer number (550050165664).
Almost surely, 21100100331327 is an apocalyptic number.
1100100331327 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100100331327 is an equidigital number, since it uses as much as digits as its factorization.
1100100331327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 22.
Adding to 1100100331327 its reverse (7231330010011), we get a palindrome (8331430341338).
The spelling of 1100100331327 in words is "one trillion, one hundred billion, one hundred million, three hundred thirty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •