Base | Representation |
---|---|
bin | 1011111111101111… |
… | …0101010011111001 |
3 | 22022102020201012101 |
4 | 2333323311103321 |
5 | 23043323224423 |
6 | 1251310343401 |
7 | 142540452121 |
oct | 27773652371 |
9 | 8272221171 |
10 | 3220133113 |
11 | 140275473a |
12 | 75a4bab61 |
13 | 3c419a712 |
14 | 227949c81 |
15 | 13ca787ad |
hex | bfef54f9 |
3220133113 has 2 divisors, whose sum is σ = 3220133114. Its totient is φ = 3220133112.
The previous prime is 3220133039. The next prime is 3220133123. The reversal of 3220133113 is 3113310223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2857116304 + 363016809 = 53452^2 + 19053^2 .
It is an emirp because it is prime and its reverse (3113310223) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3220133113 is a prime.
It is not a weakly prime, because it can be changed into another prime (3220133123) 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 as a sum of consecutive naturals, namely, 1610066556 + 1610066557.
It is an arithmetic number, because the mean of its divisors is an integer number (1610066557).
Almost surely, 23220133113 is an apocalyptic number.
It is an amenable number.
3220133113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220133113 is an equidigital number, since it uses as much as digits as its factorization.
3220133113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 3220133113 is about 56746.2167285186. The cubic root of 3220133113 is about 1476.6965999760.
Adding to 3220133113 its reverse (3113310223), we get a palindrome (6333443336).
The spelling of 3220133113 in words is "three billion, two hundred twenty million, one hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •