Base | Representation |
---|---|
bin | 1010100100111… |
… | …1000101011001 |
3 | 10002110221010121 |
4 | 2221033011121 |
5 | 42324122441 |
6 | 4222513241 |
7 | 1046042314 |
oct | 251170531 |
9 | 102427117 |
10 | 44364121 |
11 | 2305146a |
12 | 12a35821 |
13 | 9264079 |
14 | 5c6b97b |
15 | 3d64dd1 |
hex | 2a4f159 |
44364121 has 2 divisors, whose sum is σ = 44364122. Its totient is φ = 44364120.
The previous prime is 44364119. The next prime is 44364157. The reversal of 44364121 is 12146344.
44364121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33235225 + 11128896 = 5765^2 + 3336^2 .
It is a cyclic number.
It is not a de Polignac number, because 44364121 - 21 = 44364119 is a prime.
Together with 44364119, it forms a pair of twin primes.
It is equal to p2682043 and since 44364121 and 2682043 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (44364161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22182060 + 22182061.
It is an arithmetic number, because the mean of its divisors is an integer number (22182061).
Almost surely, 244364121 is an apocalyptic number.
It is an amenable number.
44364121 is a deficient number, since it is larger than the sum of its proper divisors (1).
44364121 is an equidigital number, since it uses as much as digits as its factorization.
44364121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2304, while the sum is 25.
The square root of 44364121 is about 6660.6396839943. The cubic root of 44364121 is about 354.0060033880.
The spelling of 44364121 in words is "forty-four million, three hundred sixty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •