Base | Representation |
---|---|
bin | 1001010110010100100… |
… | …10000100001100100001 |
3 | 1010201010110120102220021 |
4 | 10223022102010030201 |
5 | 20230330124011223 |
6 | 403322251313441 |
7 | 32131110053425 |
oct | 4531222041441 |
9 | 1121113512807 |
10 | 321221313313 |
11 | 11425806a06a |
12 | 5230844b881 |
13 | 243a2550b34 |
14 | 11793704b85 |
15 | 855077565d |
hex | 4aca484321 |
321221313313 has 2 divisors, whose sum is σ = 321221313314. Its totient is φ = 321221313312.
The previous prime is 321221313293. The next prime is 321221313317. The reversal of 321221313313 is 313313122123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 289953171729 + 31268141584 = 538473^2 + 176828^2 .
It is an emirp because it is prime and its reverse (313313122123) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 321221313313 - 229 = 320684442401 is a prime.
It is a super-2 number, since 2×3212213133132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (321221313317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160610656656 + 160610656657.
It is an arithmetic number, because the mean of its divisors is an integer number (160610656657).
Almost surely, 2321221313313 is an apocalyptic number.
It is an amenable number.
321221313313 is a deficient number, since it is larger than the sum of its proper divisors (1).
321221313313 is an equidigital number, since it uses as much as digits as its factorization.
321221313313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1944, while the sum is 25.
Adding to 321221313313 its reverse (313313122123), we get a palindrome (634534435436).
The spelling of 321221313313 in words is "three hundred twenty-one billion, two hundred twenty-one million, three hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •