Base | Representation |
---|---|
bin | 11000101000000110… |
… | …00000001010101001 |
3 | 1021010102002020112012 |
4 | 30110003000022221 |
5 | 204034113431241 |
6 | 10023532525305 |
7 | 645430425512 |
oct | 142403001251 |
9 | 37112066465 |
10 | 13221233321 |
11 | 567505030a |
12 | 268b920835 |
13 | 13291818aa |
14 | 8d5cb7a09 |
15 | 525aa26eb |
hex | 3140c02a9 |
13221233321 has 2 divisors, whose sum is σ = 13221233322. Its totient is φ = 13221233320.
The previous prime is 13221233303. The next prime is 13221233323. The reversal of 13221233321 is 12333212231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12004270096 + 1216963225 = 109564^2 + 34885^2 .
It is an emirp because it is prime and its reverse (12333212231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13221233321 is a prime.
Together with 13221233323, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13221233323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610616660 + 6610616661.
It is an arithmetic number, because the mean of its divisors is an integer number (6610616661).
Almost surely, 213221233321 is an apocalyptic number.
It is an amenable number.
13221233321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13221233321 is an equidigital number, since it uses as much as digits as its factorization.
13221233321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 23.
Adding to 13221233321 its reverse (12333212231), we get a palindrome (25554445552).
The spelling of 13221233321 in words is "thirteen billion, two hundred twenty-one million, two hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •