Base | Representation |
---|---|
bin | 10011010101101… |
… | …001001111011101 |
3 | 211121111022110022 |
4 | 103111221033131 |
5 | 1131024103203 |
6 | 52105521525 |
7 | 11016463166 |
oct | 2325511735 |
9 | 747438408 |
10 | 324441053 |
11 | 157158402 |
12 | 907a32a5 |
13 | 522a7771 |
14 | 3113676d |
15 | 1d73aa38 |
hex | 135693dd |
324441053 has 2 divisors, whose sum is σ = 324441054. Its totient is φ = 324441052.
The previous prime is 324441031. The next prime is 324441079. The reversal of 324441053 is 350144423.
It is an a-pointer prime, because the next prime (324441079) can be obtained adding 324441053 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 313537849 + 10903204 = 17707^2 + 3302^2 .
It is a cyclic number.
It is not a de Polignac number, because 324441053 - 26 = 324440989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (324441353) 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, 162220526 + 162220527.
It is an arithmetic number, because the mean of its divisors is an integer number (162220527).
Almost surely, 2324441053 is an apocalyptic number.
It is an amenable number.
324441053 is a deficient number, since it is larger than the sum of its proper divisors (1).
324441053 is an equidigital number, since it uses as much as digits as its factorization.
324441053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 26.
The square root of 324441053 is about 18012.2473056529. The cubic root of 324441053 is about 687.1400583287.
Adding to 324441053 its reverse (350144423), we get a palindrome (674585476).
The spelling of 324441053 in words is "three hundred twenty-four million, four hundred forty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •