Base | Representation |
---|---|
bin | 1010100000001… |
… | …0010101110101 |
3 | 10001212221221101 |
4 | 2220002111311 |
5 | 42234043111 |
6 | 4212050101 |
7 | 1043263006 |
oct | 250022565 |
9 | 101787841 |
10 | 44049781 |
11 | 22957286 |
12 | 12903931 |
13 | 9183c79 |
14 | 5bc91ad |
15 | 3d01bc1 |
hex | 2a02575 |
44049781 has 2 divisors, whose sum is σ = 44049782. Its totient is φ = 44049780.
The previous prime is 44049767. The next prime is 44049787. The reversal of 44049781 is 18794044.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31024900 + 13024881 = 5570^2 + 3609^2 .
It is a cyclic number.
It is not a de Polignac number, because 44049781 - 211 = 44047733 is a prime.
It is a super-2 number, since 2×440497812 = 3880766412295922, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 44049781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44049787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22024890 + 22024891.
It is an arithmetic number, because the mean of its divisors is an integer number (22024891).
Almost surely, 244049781 is an apocalyptic number.
It is an amenable number.
44049781 is a deficient number, since it is larger than the sum of its proper divisors (1).
44049781 is an equidigital number, since it uses as much as digits as its factorization.
44049781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 37.
The square root of 44049781 is about 6637.0009040228. Note that the first 3 decimals coincide. The cubic root of 44049781 is about 353.1679229522.
The spelling of 44049781 in words is "forty-four million, forty-nine thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •