Base | Representation |
---|---|
bin | 10100000011011000100001… |
… | …10011000110111100111111 |
3 | 12210010121022121112122210022 |
4 | 22001230100303012330333 |
5 | 21234440031012430221 |
6 | 233441425512002355 |
7 | 12200611415362616 |
oct | 1201542063067477 |
9 | 183117277478708 |
10 | 44096711061311 |
11 | 13061345882497 |
12 | 4b422a33903bb |
13 | 1b7b3c069425c |
14 | ac6413b3c87d |
15 | 5170cb2e64ab |
hex | 281b10cc6f3f |
44096711061311 has 2 divisors, whose sum is σ = 44096711061312. Its totient is φ = 44096711061310.
The previous prime is 44096711061301. The next prime is 44096711061313. The reversal of 44096711061311 is 11316011769044.
44096711061311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-44096711061311 is a prime.
Together with 44096711061313, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44096711061313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22048355530655 + 22048355530656.
It is an arithmetic number, because the mean of its divisors is an integer number (22048355530656).
Almost surely, 244096711061311 is an apocalyptic number.
44096711061311 is a deficient number, since it is larger than the sum of its proper divisors (1).
44096711061311 is an equidigital number, since it uses as much as digits as its factorization.
44096711061311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 44.
The spelling of 44096711061311 in words is "forty-four trillion, ninety-six billion, seven hundred eleven million, sixty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •