Base | Representation |
---|---|
bin | 101101011010111101010… |
… | …011011000010110101101 |
3 | 102001101200022110012011222 |
4 | 231122331103120112231 |
5 | 402114431442344323 |
6 | 10345525435553125 |
7 | 441336163131014 |
oct | 55327523302655 |
9 | 12041608405158 |
10 | 3121322231213 |
11 | aa382203276a |
12 | 424b245bb7a5 |
13 | 1984549370b4 |
14 | ab103aa9a7b |
15 | 562d582b9c8 |
hex | 2d6bd4d85ad |
3121322231213 has 2 divisors, whose sum is σ = 3121322231214. Its totient is φ = 3121322231212.
The previous prime is 3121322231149. The next prime is 3121322231231.
3121322231213 is nontrivially palindromic in base 10.
Together with next prime (3121322231231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2558841731044 + 562480500169 = 1599638^2 + 749987^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 3121322231213 - 26 = 3121322231149 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3121321231213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560661115606 + 1560661115607.
It is an arithmetic number, because the mean of its divisors is an integer number (1560661115607).
Almost surely, 23121322231213 is an apocalyptic number.
It is an amenable number.
3121322231213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121322231213 is an equidigital number, since it uses as much as digits as its factorization.
3121322231213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 26.
The spelling of 3121322231213 in words is "three trillion, one hundred twenty-one billion, three hundred twenty-two million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •