Base | Representation |
---|---|
bin | 10100000011100111000010… |
… | …11110101011001001111101 |
3 | 12210011100102221011222002211 |
4 | 22001303201132223021331 |
5 | 21240102012310010023 |
6 | 233445155244220421 |
7 | 12201305541610600 |
oct | 1201634136531175 |
9 | 183140387158084 |
10 | 44104507110013 |
11 | 13064686509249 |
12 | 4b438ba23a711 |
13 | 1b7c06389871c |
14 | ac69532b6337 |
15 | 5173d5956a0d |
hex | 281ce17ab27d |
44104507110013 has 6 divisors (see below), whose sum is σ = 51305242964766. Its totient is φ = 37803863237112.
The previous prime is 44104507109939. The next prime is 44104507110089. The reversal of 44104507110013 is 31001170540144.
It can be written as a sum of positive squares in only one way, i.e., 23317135603524 + 20787371506489 = 4828782^2 + 4559317^2 .
It is not a de Polignac number, because 44104507110013 - 213 = 44104507101821 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44104507110913) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 450045990870 + ... + 450045990967.
It is an arithmetic number, because the mean of its divisors is an integer number (8550873827461).
Almost surely, 244104507110013 is an apocalyptic number.
It is an amenable number.
44104507110013 is a deficient number, since it is larger than the sum of its proper divisors (7200735854753).
44104507110013 is an equidigital number, since it uses as much as digits as its factorization.
44104507110013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 900091981851 (or 900091981844 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 31.
Adding to 44104507110013 its reverse (31001170540144), we get a palindrome (75105677650157).
The spelling of 44104507110013 in words is "forty-four trillion, one hundred four billion, five hundred seven million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •