Base | Representation |
---|---|
bin | 1011111011001010… |
… | …0101110011011001 |
3 | 22021002010020201002 |
4 | 2332302211303121 |
5 | 23023414324311 |
6 | 1245343034345 |
7 | 142215324263 |
oct | 27662456331 |
9 | 8232106632 |
10 | 3200933081 |
11 | 13a2930445 |
12 | 753b9b9b5 |
13 | 3c0207458 |
14 | 22518cb33 |
15 | 13b03493b |
hex | beca5cd9 |
3200933081 has 2 divisors, whose sum is σ = 3200933082. Its totient is φ = 3200933080.
The previous prime is 3200933063. The next prime is 3200933083. The reversal of 3200933081 is 1803390023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1972781056 + 1228152025 = 44416^2 + 35045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3200933081 is a prime.
It is a super-2 number, since 2×32009330812 = 20491945178080305122, which contains 22 as substring.
Together with 3200933083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3200933083) 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, 1600466540 + 1600466541.
It is an arithmetic number, because the mean of its divisors is an integer number (1600466541).
Almost surely, 23200933081 is an apocalyptic number.
It is an amenable number.
3200933081 is a deficient number, since it is larger than the sum of its proper divisors (1).
3200933081 is an equidigital number, since it uses as much as digits as its factorization.
3200933081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 3200933081 is about 56576.7892425860. The cubic root of 3200933081 is about 1473.7558146952.
The spelling of 3200933081 in words is "three billion, two hundred million, nine hundred thirty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •