Base | Representation |
---|---|
bin | 1001011100000110011… |
… | …10010101101011101001 |
3 | 1011000010201001102022101 |
4 | 10232003032111223221 |
5 | 20303203433340241 |
6 | 404554211253401 |
7 | 32301024355054 |
oct | 4560316255351 |
9 | 1130121042271 |
10 | 324324121321 |
11 | 1155aa569702 |
12 | 52a335aa261 |
13 | 2477831ccc5 |
14 | 119a982da9b |
15 | 8682d75e31 |
hex | 4b83395ae9 |
324324121321 has 2 divisors, whose sum is σ = 324324121322. Its totient is φ = 324324121320.
The previous prime is 324324121307. The next prime is 324324121337. The reversal of 324324121321 is 123121423423.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 312033960000 + 12290161321 = 558600^2 + 110861^2 .
It is a cyclic number.
It is not a de Polignac number, because 324324121321 - 215 = 324324088553 is a prime.
It is a super-2 number, since 2×3243241213212 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 324324121321.
It is not a weakly prime, because it can be changed into another prime (324324121351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 162162060660 + 162162060661.
It is an arithmetic number, because the mean of its divisors is an integer number (162162060661).
Almost surely, 2324324121321 is an apocalyptic number.
It is an amenable number.
324324121321 is a deficient number, since it is larger than the sum of its proper divisors (1).
324324121321 is an equidigital number, since it uses as much as digits as its factorization.
324324121321 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6912, while the sum is 28.
Adding to 324324121321 its reverse (123121423423), we get a palindrome (447445544744).
The spelling of 324324121321 in words is "three hundred twenty-four billion, three hundred twenty-four million, one hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •