Base | Representation |
---|---|
bin | 10100000100010100100000… |
… | …00010011101111011000001 |
3 | 12210020200102122120221002010 |
4 | 22002022100002131323001 |
5 | 21241002002101040212 |
6 | 233504312555043133 |
7 | 12203131353553053 |
oct | 1202122002357301 |
9 | 183220378527063 |
10 | 44128910565057 |
11 | 13073a6963720a |
12 | 4b4858aa404a9 |
13 | 1b81452645b56 |
14 | ac7bca3358d3 |
15 | 517d6309003c |
hex | 28229009dec1 |
44128910565057 has 8 divisors (see below), whose sum is σ = 58839306086176. Its totient is φ = 29418894376992.
The previous prime is 44128910565041. The next prime is 44128910565079. The reversal of 44128910565057 is 75056501982144.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 44128910565057 - 24 = 44128910565041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 44128910564988 and 44128910565006.
It is not an unprimeable number, because it can be changed into a prime (44128910566057) 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, 94561708 + ... + 95027229.
It is an arithmetic number, because the mean of its divisors is an integer number (7354913260772).
Almost surely, 244128910565057 is an apocalyptic number.
It is an amenable number.
44128910565057 is a deficient number, since it is larger than the sum of its proper divisors (14710395521119).
44128910565057 is a wasteful number, since it uses less digits than its factorization.
44128910565057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189666527.
The product of its (nonzero) digits is 12096000, while the sum is 57.
The spelling of 44128910565057 in words is "forty-four trillion, one hundred twenty-eight billion, nine hundred ten million, five hundred sixty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •