Base | Representation |
---|---|
bin | 1011111011001101… |
… | …0001110010101101 |
3 | 22021002110101212102 |
4 | 2332303101302231 |
5 | 23023441111021 |
6 | 1245350544445 |
7 | 142220004503 |
oct | 27663216255 |
9 | 8232411772 |
10 | 3201113261 |
11 | 13a2a43855 |
12 | 754068125 |
13 | 3c026b478 |
14 | 2251d8673 |
15 | 13b06d00b |
hex | becd1cad |
3201113261 has 2 divisors, whose sum is σ = 3201113262. Its totient is φ = 3201113260.
The previous prime is 3201113197. The next prime is 3201113269. The reversal of 3201113261 is 1623111023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3161812900 + 39300361 = 56230^2 + 6269^2 .
It is a cyclic number.
It is not a de Polignac number, because 3201113261 - 26 = 3201113197 is a prime.
It is a super-2 number, since 2×32011132612 = 20494252219500108242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3201113269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1600556630 + 1600556631.
It is an arithmetic number, because the mean of its divisors is an integer number (1600556631).
Almost surely, 23201113261 is an apocalyptic number.
It is an amenable number.
3201113261 is a deficient number, since it is larger than the sum of its proper divisors (1).
3201113261 is an equidigital number, since it uses as much as digits as its factorization.
3201113261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 3201113261 is about 56578.3815692885. The cubic root of 3201113261 is about 1473.7834666677.
Adding to 3201113261 its reverse (1623111023), we get a palindrome (4824224284).
The spelling of 3201113261 in words is "three billion, two hundred one million, one hundred thirteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •