Base | Representation |
---|---|
bin | 1011111101111000… |
… | …0001110111001001 |
3 | 22021212112202220021 |
4 | 2333132001313021 |
5 | 23034323221301 |
6 | 1250431100441 |
7 | 142414162006 |
oct | 27736016711 |
9 | 8255482807 |
10 | 3212320201 |
11 | 13a92a8792 |
12 | 757971721 |
13 | 3c26934ac |
14 | 2268b48ad |
15 | 13c0338a1 |
hex | bf781dc9 |
3212320201 has 2 divisors, whose sum is σ = 3212320202. Its totient is φ = 3212320200.
The previous prime is 3212320157. The next prime is 3212320211. The reversal of 3212320201 is 1020232123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2576070025 + 636250176 = 50755^2 + 25224^2 .
It is an emirp because it is prime and its reverse (1020232123) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3212320201 - 27 = 3212320073 is a prime.
It is not a weakly prime, because it can be changed into another prime (3212320211) 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, 1606160100 + 1606160101.
It is an arithmetic number, because the mean of its divisors is an integer number (1606160101).
Almost surely, 23212320201 is an apocalyptic number.
It is an amenable number.
3212320201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3212320201 is an equidigital number, since it uses as much as digits as its factorization.
3212320201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 3212320201 is about 56677.3341027963. The cubic root of 3212320201 is about 1475.5013446199.
Adding to 3212320201 its reverse (1020232123), we get a palindrome (4232552324).
The spelling of 3212320201 in words is "three billion, two hundred twelve million, three hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •