Base | Representation |
---|---|
bin | 1001011100001011000… |
… | …00111100001101100001 |
3 | 1011000020101100220111211 |
4 | 10232011200330031201 |
5 | 20303243303132121 |
6 | 405002103110121 |
7 | 32302002126244 |
oct | 4560540741541 |
9 | 1130211326454 |
10 | 324362552161 |
11 | 11561a22832a |
12 | 52a44442341 |
13 | 2478328754b |
14 | 119b099525b |
15 | 8686417ce1 |
hex | 4b8583c361 |
324362552161 has 2 divisors, whose sum is σ = 324362552162. Its totient is φ = 324362552160.
The previous prime is 324362552153. The next prime is 324362552167. The reversal of 324362552161 is 161255263423.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 277550902561 + 46811649600 = 526831^2 + 216360^2 .
It is an emirp because it is prime and its reverse (161255263423) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 324362552161 - 23 = 324362552153 is a prime.
It is a super-2 number, since 2×3243625521612 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (324362552167) 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, 162181276080 + 162181276081.
It is an arithmetic number, because the mean of its divisors is an integer number (162181276081).
Almost surely, 2324362552161 is an apocalyptic number.
It is an amenable number.
324362552161 is a deficient number, since it is larger than the sum of its proper divisors (1).
324362552161 is an equidigital number, since it uses as much as digits as its factorization.
324362552161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 259200, while the sum is 40.
The spelling of 324362552161 in words is "three hundred twenty-four billion, three hundred sixty-two million, five hundred fifty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •