Base | Representation |
---|---|
bin | 10011010001010001001… |
… | …001000000110011011101 |
3 | 11200121000120002002120021 |
4 | 103101101021000303131 |
5 | 133143441034304003 |
6 | 2452200110352141 |
7 | 164446121600332 |
oct | 23212111006335 |
9 | 4617016062507 |
10 | 1324211244253 |
11 | 47065a7a8367 |
12 | 1947837bb651 |
13 | 97b460b6a81 |
14 | 48140c92989 |
15 | 246a47422bd |
hex | 13451240cdd |
1324211244253 has 2 divisors, whose sum is σ = 1324211244254. Its totient is φ = 1324211244252.
The previous prime is 1324211244151. The next prime is 1324211244277. The reversal of 1324211244253 is 3524421124231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 876204579364 + 448006664889 = 936058^2 + 669333^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1324211244253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1324211244353) 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, 662105622126 + 662105622127.
It is an arithmetic number, because the mean of its divisors is an integer number (662105622127).
Almost surely, 21324211244253 is an apocalyptic number.
It is an amenable number.
1324211244253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1324211244253 is an equidigital number, since it uses as much as digits as its factorization.
1324211244253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46080, while the sum is 34.
Adding to 1324211244253 its reverse (3524421124231), we get a palindrome (4848632368484).
The spelling of 1324211244253 in words is "one trillion, three hundred twenty-four billion, two hundred eleven million, two hundred forty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •