Base | Representation |
---|---|
bin | 101001010001111011… |
… | …100001001111101001 |
3 | 11020102000212012001122 |
4 | 221101323201033221 |
5 | 1211234000330441 |
6 | 32210130025025 |
7 | 3126252511463 |
oct | 512173411751 |
9 | 136360765048 |
10 | 44324230121 |
11 | 17885966146 |
12 | 8710118175 |
13 | 4244c06702 |
14 | 2206a01133 |
15 | 124645534b |
hex | a51ee13e9 |
44324230121 has 4 divisors (see below), whose sum is σ = 44326153092. Its totient is φ = 44322307152.
The previous prime is 44324230081. The next prime is 44324230151. The reversal of 44324230121 is 12103242344.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1373740096 + 42950490025 = 37064^2 + 207245^2 .
It is a cyclic number.
It is not a de Polignac number, because 44324230121 - 214 = 44324213737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (44324230151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 926486 + ... + 973151.
It is an arithmetic number, because the mean of its divisors is an integer number (11081538273).
Almost surely, 244324230121 is an apocalyptic number.
It is an amenable number.
44324230121 is a deficient number, since it is larger than the sum of its proper divisors (1922971).
44324230121 is a wasteful number, since it uses less digits than its factorization.
44324230121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1922970.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 44324230121 its reverse (12103242344), we get a palindrome (56427472465).
The spelling of 44324230121 in words is "forty-four billion, three hundred twenty-four million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •