Base | Representation |
---|---|
bin | 1011111110000100… |
… | …1010010101010011 |
3 | 22021221002111021111 |
4 | 2333201022111103 |
5 | 23040031010311 |
6 | 1250500434151 |
7 | 142424151661 |
oct | 27741122523 |
9 | 8257074244 |
10 | 3213141331 |
11 | 13a9809704 |
12 | 7580a8957 |
13 | 3c28c017a |
14 | 226a49c31 |
15 | 13c146d21 |
hex | bf84a553 |
3213141331 has 8 divisors (see below), whose sum is σ = 3430817280. Its totient is φ = 3001963272.
The previous prime is 3213141307. The next prime is 3213141353. The reversal of 3213141331 is 1331413123.
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 3213141331 - 25 = 3213141299 is a prime.
It is a super-2 number, since 2×32131413312 = 20648554425960903122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3213141301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1623451 + ... + 1625428.
It is an arithmetic number, because the mean of its divisors is an integer number (428852160).
Almost surely, 23213141331 is an apocalyptic number.
3213141331 is a deficient number, since it is larger than the sum of its proper divisors (217675949).
3213141331 is a wasteful number, since it uses less digits than its factorization.
3213141331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3248945.
The product of its digits is 648, while the sum is 22.
The square root of 3213141331 is about 56684.5775409855. The cubic root of 3213141331 is about 1475.6270559567.
Adding to 3213141331 its reverse (1331413123), we get a palindrome (4544554454).
The spelling of 3213141331 in words is "three billion, two hundred thirteen million, one hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •