Base | Representation |
---|---|
bin | 10000000100011111011… |
… | …011111101110111100111 |
3 | 10220120110221021210120122 |
4 | 100010133123331313213 |
5 | 121043134002120241 |
6 | 2203153554352155 |
7 | 142533266201402 |
oct | 20043733756747 |
9 | 3816427253518 |
10 | 1104334020071 |
11 | 396388845467 |
12 | 15a03b28b65b |
13 | 801a49794a9 |
14 | 3b642d28d39 |
15 | 1dad620504b |
hex | 1011f6fdde7 |
1104334020071 has 2 divisors, whose sum is σ = 1104334020072. Its totient is φ = 1104334020070.
The previous prime is 1104334020043. The next prime is 1104334020073. The reversal of 1104334020071 is 1700204334011.
It is a strong prime.
It is an emirp because it is prime and its reverse (1700204334011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1104334020071 - 226 = 1104266911207 is a prime.
Together with 1104334020073, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1104334020071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104334020073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552167010035 + 552167010036.
It is an arithmetic number, because the mean of its divisors is an integer number (552167010036).
Almost surely, 21104334020071 is an apocalyptic number.
1104334020071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104334020071 is an equidigital number, since it uses as much as digits as its factorization.
1104334020071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 1104334020071 its reverse (1700204334011), we get a palindrome (2804538354082).
The spelling of 1104334020071 in words is "one trillion, one hundred four billion, three hundred thirty-four million, twenty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •