Base | Representation |
---|---|
bin | 10000000100011111111… |
… | …111001000111010000111 |
3 | 10220120111120122020101121 |
4 | 100010133333020322013 |
5 | 121043143332142302 |
6 | 2203154524134411 |
7 | 142533440442535 |
oct | 20043777107207 |
9 | 3816446566347 |
10 | 1104343240327 |
11 | 396392a72808 |
12 | 15a042397407 |
13 | 801a6857172 |
14 | 3b644249155 |
15 | 1dad6e26e37 |
hex | 1011ffc8e87 |
1104343240327 has 2 divisors, whose sum is σ = 1104343240328. Its totient is φ = 1104343240326.
The previous prime is 1104343240307. The next prime is 1104343240331. The reversal of 1104343240327 is 7230423434011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1104343240327 - 215 = 1104343207559 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1104343240292 and 1104343240301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104343240307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552171620163 + 552171620164.
It is an arithmetic number, because the mean of its divisors is an integer number (552171620164).
Almost surely, 21104343240327 is an apocalyptic number.
1104343240327 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104343240327 is an equidigital number, since it uses as much as digits as its factorization.
1104343240327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 34.
Adding to 1104343240327 its reverse (7230423434011), we get a palindrome (8334766674338).
The spelling of 1104343240327 in words is "one trillion, one hundred four billion, three hundred forty-three million, two hundred forty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •