Base | Representation |
---|---|
bin | 1011111101110101… |
… | …0011111111011001 |
3 | 22021212012020011110 |
4 | 2333131103333121 |
5 | 23034301213223 |
6 | 1250423050533 |
7 | 142412450145 |
oct | 27735237731 |
9 | 8255166143 |
10 | 3212132313 |
11 | 13a918a605 |
12 | 7578a0a49 |
13 | 3c2628b10 |
14 | 226866225 |
15 | 13bee7d93 |
hex | bf753fd9 |
3212132313 has 8 divisors (see below), whose sum is σ = 4612292608. Its totient is φ = 1976696784.
The previous prime is 3212132281. The next prime is 3212132317. The reversal of 3212132313 is 3132312123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3212132313 - 25 = 3212132281 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3212132313.
It is not an unprimeable number, because it can be changed into a prime (3212132317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41181145 + ... + 41181222.
It is an arithmetic number, because the mean of its divisors is an integer number (576536576).
Almost surely, 23212132313 is an apocalyptic number.
It is an amenable number.
3212132313 is a deficient number, since it is larger than the sum of its proper divisors (1400160295).
3212132313 is a wasteful number, since it uses less digits than its factorization.
3212132313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82362383.
The product of its digits is 648, while the sum is 21.
The square root of 3212132313 is about 56675.6765552913. The cubic root of 3212132313 is about 1475.4725767943.
Adding to 3212132313 its reverse (3132312123), we get a palindrome (6344444436).
The spelling of 3212132313 in words is "three billion, two hundred twelve million, one hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •