Base | Representation |
---|---|
bin | 101110110000100011100… |
… | …011110010110011111101 |
3 | 102101011220200010110111002 |
4 | 232300203203302303331 |
5 | 410121144410420013 |
6 | 10500045523540045 |
7 | 451101613253414 |
oct | 56604343626375 |
9 | 12334820113432 |
10 | 3213232123133 |
11 | 10297a684592a |
12 | 43a8b4b2a625 |
13 | 1a4011344526 |
14 | b17424c847b |
15 | 588b46bc358 |
hex | 2ec238f2cfd |
3213232123133 has 2 divisors, whose sum is σ = 3213232123134. Its totient is φ = 3213232123132.
The previous prime is 3213232123069. The next prime is 3213232123163. The reversal of 3213232123133 is 3313212323123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3087846729529 + 125385393604 = 1757227^2 + 354098^2 .
It is a cyclic number.
It is not a de Polignac number, because 3213232123133 - 26 = 3213232123069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3213232123096 and 3213232123105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3213232123163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1606616061566 + 1606616061567.
It is an arithmetic number, because the mean of its divisors is an integer number (1606616061567).
Almost surely, 23213232123133 is an apocalyptic number.
It is an amenable number.
3213232123133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3213232123133 is an equidigital number, since it uses as much as digits as its factorization.
3213232123133 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11664, while the sum is 29.
Adding to 3213232123133 its reverse (3313212323123), we get a palindrome (6526444446256).
The spelling of 3213232123133 in words is "three trillion, two hundred thirteen billion, two hundred thirty-two million, one hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •