Base | Representation |
---|---|
bin | 100111011011101… |
… | …0011101000111101 |
3 | 10102012200112002101 |
4 | 1032313103220331 |
5 | 10202204334323 |
6 | 335143025101 |
7 | 44534226151 |
oct | 11667235075 |
9 | 3365615071 |
10 | 1323121213 |
11 | 61995a607 |
12 | 30b13b191 |
13 | 181171c7b |
14 | c7a1d061 |
15 | 7b25adad |
hex | 4edd3a3d |
1323121213 has 2 divisors, whose sum is σ = 1323121214. Its totient is φ = 1323121212.
The previous prime is 1323121193. The next prime is 1323121229. The reversal of 1323121213 is 3121213231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1258688484 + 64432729 = 35478^2 + 8027^2 .
It is an emirp because it is prime and its reverse (3121213231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1323121213 - 213 = 1323113021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1323121273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661560606 + 661560607.
It is an arithmetic number, because the mean of its divisors is an integer number (661560607).
Almost surely, 21323121213 is an apocalyptic number.
It is an amenable number.
1323121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323121213 is an equidigital number, since it uses as much as digits as its factorization.
1323121213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 216, while the sum is 19.
The square root of 1323121213 is about 36374.7331674062. The cubic root of 1323121213 is about 1097.8252384700.
Adding to 1323121213 its reverse (3121213231), we get a palindrome (4444334444).
The spelling of 1323121213 in words is "one billion, three hundred twenty-three million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •