Base | Representation |
---|---|
bin | 10100000011101011001100… |
… | …00000010101001001001001 |
3 | 12210011120011212221011102120 |
4 | 22001311212000111021021 |
5 | 21240121041003302012 |
6 | 233450204031521453 |
7 | 12201414620412021 |
oct | 1201654600251111 |
9 | 183146155834376 |
10 | 44106730525257 |
11 | 13065617581004 |
12 | 4b4421a989289 |
13 | 1b7c329407b4a |
14 | ac6ac46caa81 |
15 | 5174b5c4b58c |
hex | 281d66015249 |
44106730525257 has 8 divisors (see below), whose sum is σ = 58809222794784. Its totient is φ = 29404362636288.
The previous prime is 44106730525229. The next prime is 44106730525261. The reversal of 44106730525257 is 75252503760144.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-44106730525257 is a prime.
It is a super-2 number, since 2×441067305252572 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (44106730525267) 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 in 7 ways as a sum of consecutive naturals, for example, 30264543 + ... + 31688420.
It is an arithmetic number, because the mean of its divisors is an integer number (7351152849348).
Almost surely, 244106730525257 is an apocalyptic number.
It is an amenable number.
44106730525257 is a deficient number, since it is larger than the sum of its proper divisors (14702492269527).
44106730525257 is a wasteful number, since it uses less digits than its factorization.
44106730525257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62190279.
The product of its (nonzero) digits is 7056000, while the sum is 51.
The spelling of 44106730525257 in words is "forty-four trillion, one hundred six billion, seven hundred thirty million, five hundred twenty-five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •