Base | Representation |
---|---|
bin | 1001011100010100101… |
… | …01001000111000011001 |
3 | 1011000110000101120122022 |
4 | 10232022111020320121 |
5 | 20303424444010114 |
6 | 405014110504225 |
7 | 32304002632202 |
oct | 4561225107031 |
9 | 1130400346568 |
10 | 324443344409 |
11 | 11566089a788 |
12 | 52a67505075 |
13 | 24796c34402 |
14 | 119bb5c65a9 |
15 | 868d57648e |
hex | 4b8a548e19 |
324443344409 has 2 divisors, whose sum is σ = 324443344410. Its totient is φ = 324443344408.
The previous prime is 324443344397. The next prime is 324443344471. The reversal of 324443344409 is 904443344423.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 238336310809 + 86107033600 = 488197^2 + 293440^2 .
It is a cyclic number.
It is not a de Polignac number, because 324443344409 - 28 = 324443344153 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 324443344409.
It is not a weakly prime, because it can be changed into another prime (324443343409) 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 as a sum of consecutive naturals, namely, 162221672204 + 162221672205.
It is an arithmetic number, because the mean of its divisors is an integer number (162221672205).
Almost surely, 2324443344409 is an apocalyptic number.
It is an amenable number.
324443344409 is a deficient number, since it is larger than the sum of its proper divisors (1).
324443344409 is an equidigital number, since it uses as much as digits as its factorization.
324443344409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1990656, while the sum is 44.
The spelling of 324443344409 in words is "three hundred twenty-four billion, four hundred forty-three million, three hundred forty-four thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •