Base | Representation |
---|---|
bin | 10000000100100101011… |
… | …101111111010001001111 |
3 | 10220120201222200221201101 |
4 | 100010211131333101033 |
5 | 121043340403312031 |
6 | 2203212011323531 |
7 | 142535635263556 |
oct | 20044535772117 |
9 | 3816658627641 |
10 | 1104435213391 |
11 | 39642a981504 |
12 | 15a0691505a7 |
13 | 801bc91a1b3 |
14 | 3b65254ad9d |
15 | 1dae0043361 |
hex | 1012577f44f |
1104435213391 has 2 divisors, whose sum is σ = 1104435213392. Its totient is φ = 1104435213390.
The previous prime is 1104435213353. The next prime is 1104435213449. The reversal of 1104435213391 is 1933125344011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1104435213391 - 219 = 1104434689103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1104435213391.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104435213331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552217606695 + 552217606696.
It is an arithmetic number, because the mean of its divisors is an integer number (552217606696).
Almost surely, 21104435213391 is an apocalyptic number.
1104435213391 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104435213391 is an equidigital number, since it uses as much as digits as its factorization.
1104435213391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 1104435213391 in words is "one trillion, one hundred four billion, four hundred thirty-five million, two hundred thirteen thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •