Base | Representation |
---|---|
bin | 1111011111010101001… |
… | …00001010100010111001 |
3 | 1212212202001220122202222 |
4 | 13233222210022202321 |
5 | 32204434334420304 |
6 | 1044255150533425 |
7 | 53310550063112 |
oct | 7575244124271 |
9 | 1785661818688 |
10 | 532216326329 |
11 | 195791272286 |
12 | 87192207275 |
13 | 3b25973c76c |
14 | 1ba8bb59209 |
15 | dc9e1014be |
hex | 7bea90a8b9 |
532216326329 has 2 divisors, whose sum is σ = 532216326330. Its totient is φ = 532216326328.
The previous prime is 532216326319. The next prime is 532216326331. The reversal of 532216326329 is 923623612235.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 327582233104 + 204634093225 = 572348^2 + 452365^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-532216326329 is a prime.
It is a super-2 number, since 2×5322163263292 (a number of 24 digits) contains 22 as substring.
Together with 532216326331, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 532216326329.
It is not a weakly prime, because it can be changed into another prime (532216326319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 266108163164 + 266108163165.
It is an arithmetic number, because the mean of its divisors is an integer number (266108163165).
Almost surely, 2532216326329 is an apocalyptic number.
It is an amenable number.
532216326329 is a deficient number, since it is larger than the sum of its proper divisors (1).
532216326329 is an equidigital number, since it uses as much as digits as its factorization.
532216326329 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 699840, while the sum is 44.
The spelling of 532216326329 in words is "five hundred thirty-two billion, two hundred sixteen million, three hundred twenty-six thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •