Base | Representation |
---|---|
bin | 10100000011101010110010… |
… | …01111000000101110111101 |
3 | 12210011112121221202212111011 |
4 | 22001311121033000232331 |
5 | 21240120121131120023 |
6 | 233450130455355221 |
7 | 12201406406313121 |
oct | 1201653117005675 |
9 | 183145557685434 |
10 | 44106516270013 |
11 | 1306551764195a |
12 | 4b4417b082b11 |
13 | 1b7c2c3bcc1b2 |
14 | ac6aa4077581 |
15 | 5174a202850d |
hex | 281d593c0bbd |
44106516270013 has 16 divisors (see below), whose sum is σ = 44530248597120. Its totient is φ = 43683136056000.
The previous prime is 44106516269957. The next prime is 44106516270073. The reversal of 44106516270013 is 31007261560144.
44106516270013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 44106516270013 - 241 = 41907493014461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44106516270073) 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 in 15 ways as a sum of consecutive naturals, for example, 3684441118 + ... + 3684453088.
It is an arithmetic number, because the mean of its divisors is an integer number (2783140537320).
Almost surely, 244106516270013 is an apocalyptic number.
It is an amenable number.
44106516270013 is a deficient number, since it is larger than the sum of its proper divisors (423732327107).
44106516270013 is a wasteful number, since it uses less digits than its factorization.
44106516270013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23748.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 44106516270013 in words is "forty-four trillion, one hundred six billion, five hundred sixteen million, two hundred seventy thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •