Base | Representation |
---|---|
bin | 10000000100100101010… |
… | …011010011000110010111 |
3 | 10220120201210102120121021 |
4 | 100010211103103012113 |
5 | 121043334144123111 |
6 | 2203211431302011 |
7 | 142535602412455 |
oct | 20044523230627 |
9 | 3816653376537 |
10 | 1104432411031 |
11 | 396429338004 |
12 | 15a06821a907 |
13 | 801bc1787b1 |
14 | 3b65201b9d5 |
15 | 1dadeb8cd71 |
hex | 101254d3197 |
1104432411031 has 2 divisors, whose sum is σ = 1104432411032. Its totient is φ = 1104432411030.
The previous prime is 1104432411023. The next prime is 1104432411059. The reversal of 1104432411031 is 1301142344011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1104432411031 - 23 = 1104432411023 is a prime.
It is a super-2 number, since 2×11044324110312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1104432410987 and 1104432411005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104432411011) 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, 552216205515 + 552216205516.
It is an arithmetic number, because the mean of its divisors is an integer number (552216205516).
Almost surely, 21104432411031 is an apocalyptic number.
1104432411031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104432411031 is an equidigital number, since it uses as much as digits as its factorization.
1104432411031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1104432411031 its reverse (1301142344011), we get a palindrome (2405574755042).
The spelling of 1104432411031 in words is "one trillion, one hundred four billion, four hundred thirty-two million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •