Base | Representation |
---|---|
bin | 10000000100011111010… |
… | …001010000100101100111 |
3 | 10220120110202000012012221 |
4 | 100010133101100211213 |
5 | 121043132242310114 |
6 | 2203153414253211 |
7 | 142533233301106 |
oct | 20043721204547 |
9 | 3816422005187 |
10 | 1104331213159 |
11 | 3963871a85a9 |
12 | 15a03a357207 |
13 | 801a42059b5 |
14 | 3b6427d803d |
15 | 1dad5d4d524 |
hex | 1011f450967 |
1104331213159 has 2 divisors, whose sum is σ = 1104331213160. Its totient is φ = 1104331213158.
The previous prime is 1104331213129. The next prime is 1104331213163. The reversal of 1104331213159 is 9513121334011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1104331213159 - 217 = 1104331082087 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104331213109) 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, 552165606579 + 552165606580.
It is an arithmetic number, because the mean of its divisors is an integer number (552165606580).
Almost surely, 21104331213159 is an apocalyptic number.
1104331213159 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104331213159 is an equidigital number, since it uses as much as digits as its factorization.
1104331213159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 34.
The spelling of 1104331213159 in words is "one trillion, one hundred four billion, three hundred thirty-one million, two hundred thirteen thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •