Base | Representation |
---|---|
bin | 1011111111101111… |
… | …0110110011011111 |
3 | 22022102021000120222 |
4 | 2333323312303133 |
5 | 23043323423411 |
6 | 1251310431555 |
7 | 142540506011 |
oct | 27773666337 |
9 | 8272230528 |
10 | 3220139231 |
11 | 14027592a1 |
12 | 75a5025bb |
13 | 3c41a043a |
14 | 22794c1b1 |
15 | 13ca7a4db |
hex | bfef6cdf |
3220139231 has 2 divisors, whose sum is σ = 3220139232. Its totient is φ = 3220139230.
The previous prime is 3220139203. The next prime is 3220139233. The reversal of 3220139231 is 1329310223.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3220139231 is a prime.
It is a super-2 number, since 2×32201392312 = 20738593334050542722, which contains 22 as substring.
Together with 3220139233, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3220139231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3220139233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1610069615 + 1610069616.
It is an arithmetic number, because the mean of its divisors is an integer number (1610069616).
Almost surely, 23220139231 is an apocalyptic number.
3220139231 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220139231 is an equidigital number, since it uses as much as digits as its factorization.
3220139231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 26.
The square root of 3220139231 is about 56746.2706351704. The cubic root of 3220139231 is about 1476.6975351780.
Adding to 3220139231 its reverse (1329310223), we get a palindrome (4549449454).
The spelling of 3220139231 in words is "three billion, two hundred twenty million, one hundred thirty-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •