Base | Representation |
---|---|
bin | 101101011010110110110… |
… | …011000111011101110101 |
3 | 102001101101201010021012111 |
4 | 231122312303013131311 |
5 | 402114221024011013 |
6 | 10345510541051021 |
7 | 441333366456526 |
oct | 55326663073565 |
9 | 12041351107174 |
10 | 3121213110133 |
11 | aa3776481458 |
12 | 424ab3b56a71 |
13 | 19843814bb01 |
14 | ab0d33c284d |
15 | 562cae7473d |
hex | 2d6b6cc7775 |
3121213110133 has 2 divisors, whose sum is σ = 3121213110134. Its totient is φ = 3121213110132.
The previous prime is 3121213110101. The next prime is 3121213110143. The reversal of 3121213110133 is 3310113121213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1945849233969 + 1175363876164 = 1394937^2 + 1084142^2 .
It is a cyclic number.
It is not a de Polignac number, because 3121213110133 - 25 = 3121213110101 is a prime.
It is a super-2 number, since 2×31212131101332 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3121213110143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560606555066 + 1560606555067.
It is an arithmetic number, because the mean of its divisors is an integer number (1560606555067).
Almost surely, 23121213110133 is an apocalyptic number.
It is an amenable number.
3121213110133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121213110133 is an equidigital number, since it uses as much as digits as its factorization.
3121213110133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 3121213110133 its reverse (3310113121213), we get a palindrome (6431326231346).
The spelling of 3121213110133 in words is "three trillion, one hundred twenty-one billion, two hundred thirteen million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •