Base | Representation |
---|---|
bin | 10000000100100100000… |
… | …010000001010010011101 |
3 | 10220120200022100002102021 |
4 | 100010210002001102131 |
5 | 121043313220320123 |
6 | 2203205350500141 |
7 | 142535223332161 |
oct | 20044402012235 |
9 | 3816608302367 |
10 | 1104411104413 |
11 | 396418305031 |
12 | 15a061064651 |
13 | 801b7928726 |
14 | 3b64d272ca1 |
15 | 1dadcd7ec5d |
hex | 1012408149d |
1104411104413 has 4 divisors (see below), whose sum is σ = 1104476459488. Its totient is φ = 1104345749340.
The previous prime is 1104411104393. The next prime is 1104411104417. The reversal of 1104411104413 is 3144011144011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1104411104413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104411104417) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32652183 + ... + 32685988.
It is an arithmetic number, because the mean of its divisors is an integer number (276119114872).
Almost surely, 21104411104413 is an apocalyptic number.
It is an amenable number.
1104411104413 is a deficient number, since it is larger than the sum of its proper divisors (65355075).
1104411104413 is an equidigital number, since it uses as much as digits as its factorization.
1104411104413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65355074.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 1104411104413 its reverse (3144011144011), we get a palindrome (4248422248424).
The spelling of 1104411104413 in words is "one trillion, one hundred four billion, four hundred eleven million, one hundred four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •