Base | Representation |
---|---|
bin | 1100001001100000… |
… | …1010011111011011 |
3 | 22102021100202212021 |
4 | 3002120022133123 |
5 | 23134321124311 |
6 | 1255332555311 |
7 | 143546004646 |
oct | 30230123733 |
9 | 8367322767 |
10 | 3261114331 |
11 | 14238a5512 |
12 | 770182b37 |
13 | 3cc818a67 |
14 | 22d176a5d |
15 | 141471171 |
hex | c260a7db |
3261114331 has 2 divisors, whose sum is σ = 3261114332. Its totient is φ = 3261114330.
The previous prime is 3261114299. The next prime is 3261114341. The reversal of 3261114331 is 1334111623.
3261114331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3261114331 - 25 = 3261114299 is a prime.
It is a super-2 number, since 2×32611143312 = 21269733359707155122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3261114296 and 3261114305.
It is not a weakly prime, because it can be changed into another prime (3261114341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1630557165 + 1630557166.
It is an arithmetic number, because the mean of its divisors is an integer number (1630557166).
Almost surely, 23261114331 is an apocalyptic number.
3261114331 is a deficient number, since it is larger than the sum of its proper divisors (1).
3261114331 is an equidigital number, since it uses as much as digits as its factorization.
3261114331 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1296, while the sum is 25.
The square root of 3261114331 is about 57106.1671888422. The cubic root of 3261114331 is about 1482.9346341766.
Adding to 3261114331 its reverse (1334111623), we get a palindrome (4595225954).
The spelling of 3261114331 in words is "three billion, two hundred sixty-one million, one hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •