Base | Representation |
---|---|
bin | 1010100000010… |
… | …0000000000001 |
3 | 10001220022021002 |
4 | 2220010000001 |
5 | 42234302302 |
6 | 4212141345 |
7 | 1043321555 |
oct | 250040001 |
9 | 101808232 |
10 | 44056577 |
11 | 229613a4 |
12 | 12907855 |
13 | 91870a6 |
14 | 5bcb865 |
15 | 3d03c02 |
hex | 2a04001 |
44056577 has 2 divisors, whose sum is σ = 44056578. Its totient is φ = 44056576.
The previous prime is 44056567. The next prime is 44056609. The reversal of 44056577 is 77565044.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29986576 + 14070001 = 5476^2 + 3751^2 .
It is a cyclic number.
It is not a de Polignac number, because 44056577 - 28 = 44056321 is a prime.
It is a super-4 number, since 4×440565774 (a number of 32 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 44056577.
It is not a weakly prime, because it can be changed into another prime (44056517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22028288 + 22028289.
It is an arithmetic number, because the mean of its divisors is an integer number (22028289).
It is a Proth number, since it is equal to 2689 ⋅ 214 + 1 and 2689 < 214.
Almost surely, 244056577 is an apocalyptic number.
It is an amenable number.
44056577 is a deficient number, since it is larger than the sum of its proper divisors (1).
44056577 is an equidigital number, since it uses as much as digits as its factorization.
44056577 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 117600, while the sum is 38.
The square root of 44056577 is about 6637.5128625111. The cubic root of 44056577 is about 353.1860842668.
The spelling of 44056577 in words is "forty-four million, fifty-six thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •