Base | Representation |
---|---|
bin | 101110110000011101000… |
… | …100000001001011111111 |
3 | 102101011122002001001011111 |
4 | 232300131010001023333 |
5 | 410120434010130421 |
6 | 10500031031502451 |
7 | 451066120654456 |
oct | 56603504011377 |
9 | 12334562031144 |
10 | 3213123130111 |
11 | 1029750271854 |
12 | 43a884527a27 |
13 | 1a3cc48a260b |
14 | b1731c35b9d |
15 | 588a9d3cee1 |
hex | 2ec1d1012ff |
3213123130111 has 4 divisors (see below), whose sum is σ = 3352824135792. Its totient is φ = 3073422124432.
The previous prime is 3213123130109. The next prime is 3213123130117. The reversal of 3213123130111 is 1110313213123.
3213123130111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3213123130111 - 21 = 3213123130109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3213123130117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69850502806 + ... + 69850502851.
It is an arithmetic number, because the mean of its divisors is an integer number (838206033948).
Almost surely, 23213123130111 is an apocalyptic number.
3213123130111 is a deficient number, since it is larger than the sum of its proper divisors (139701005681).
3213123130111 is a wasteful number, since it uses less digits than its factorization.
3213123130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139701005680.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 3213123130111 its reverse (1110313213123), we get a palindrome (4323436343234).
The spelling of 3213123130111 in words is "three trillion, two hundred thirteen billion, one hundred twenty-three million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •