Base | Representation |
---|---|
bin | 101110110000010111000… |
… | …011011111110101111001 |
3 | 102101011101001100212201200 |
4 | 232300113003133311321 |
5 | 410120232204031413 |
6 | 10500013031204413 |
7 | 451063455121332 |
oct | 56602703376571 |
9 | 12334331325650 |
10 | 3213022330233 |
11 | 10296a9384371 |
12 | 43a856816709 |
13 | 1a3ca9a3ba11 |
14 | b17226b7289 |
15 | 588a107b573 |
hex | 2ec170dfd79 |
3213022330233 has 24 divisors (see below), whose sum is σ = 4793033606400. Its totient is φ = 2072884570944.
The previous prime is 3213022330213. The next prime is 3213022330249. The reversal of 3213022330233 is 3320332203123.
3213022330233 is a `hidden beast` number, since 3 + 2 + 1 + 302 + 2 + 330 + 23 + 3 = 666.
It is not a de Polignac number, because 3213022330233 - 25 = 3213022330201 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3213022330197 and 3213022330206.
It is not an unprimeable number, because it can be changed into a prime (3213022330213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42635373 + ... + 42710666.
It is an arithmetic number, because the mean of its divisors is an integer number (199709733600).
Almost surely, 23213022330233 is an apocalyptic number.
It is an amenable number.
3213022330233 is a deficient number, since it is larger than the sum of its proper divisors (1580011276167).
3213022330233 is a wasteful number, since it uses less digits than its factorization.
3213022330233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85346181 (or 85346178 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 27.
Adding to 3213022330233 its reverse (3320332203123), we get a palindrome (6533354533356).
The spelling of 3213022330233 in words is "three trillion, two hundred thirteen billion, twenty-two million, three hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •