Base | Representation |
---|---|
bin | 101110110000100011100… |
… | …000011100001101011001 |
3 | 102101011220121110210201002 |
4 | 232300203200130031121 |
5 | 410121144144302441 |
6 | 10500045453034345 |
7 | 451101602632613 |
oct | 56604340341531 |
9 | 12334817423632 |
10 | 3213231244121 |
11 | 10297a62a5478 |
12 | 43a8b47859b5 |
13 | 1a40110c73c2 |
14 | b1742339db3 |
15 | 588b4596b9b |
hex | 2ec2381c359 |
3213231244121 has 8 divisors (see below), whose sum is σ = 3230533490688. Its totient is φ = 3195933988000.
The previous prime is 3213231244099. The next prime is 3213231244147. The reversal of 3213231244121 is 1214421323123.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3213231244121 - 226 = 3213164135257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3213231244021) 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 in 7 ways as a sum of consecutive naturals, for example, 47216 + ... + 2535486.
It is an arithmetic number, because the mean of its divisors is an integer number (403816686336).
Almost surely, 23213231244121 is an apocalyptic number.
It is an amenable number.
3213231244121 is a deficient number, since it is larger than the sum of its proper divisors (17302246567).
3213231244121 is a wasteful number, since it uses less digits than its factorization.
3213231244121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2495223.
The product of its digits is 6912, while the sum is 29.
Adding to 3213231244121 its reverse (1214421323123), we get a palindrome (4427652567244).
The spelling of 3213231244121 in words is "three trillion, two hundred thirteen billion, two hundred thirty-one million, two hundred forty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •