Base | Representation |
---|---|
bin | 10000000101001001110… |
… | …000010111100011000111 |
3 | 10220122022102021002022122 |
4 | 100011021300113203013 |
5 | 121101112231324312 |
6 | 2203352240120155 |
7 | 142560010054403 |
oct | 20051160274307 |
9 | 3818272232278 |
10 | 1105044011207 |
11 | 3967125992a4 |
12 | 15a1b900605b |
13 | 80288aa63a6 |
14 | 3b6ad344103 |
15 | 1db286ecb72 |
hex | 10149c178c7 |
1105044011207 has 2 divisors, whose sum is σ = 1105044011208. Its totient is φ = 1105044011206.
The previous prime is 1105044011191. The next prime is 1105044011233. The reversal of 1105044011207 is 7021104405011.
It is an a-pointer prime, because the next prime (1105044011233) can be obtained adding 1105044011207 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1105044011207 - 24 = 1105044011191 is a prime.
It is a super-2 number, since 2×11050440112072 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105044011107) 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, 552522005603 + 552522005604.
It is an arithmetic number, because the mean of its divisors is an integer number (552522005604).
Almost surely, 21105044011207 is an apocalyptic number.
1105044011207 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105044011207 is an equidigital number, since it uses as much as digits as its factorization.
1105044011207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 1105044011207 its reverse (7021104405011), we get a palindrome (8126148416218).
The spelling of 1105044011207 in words is "one trillion, one hundred five billion, forty-four million, eleven thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •