Base | Representation |
---|---|
bin | 1011111011001110… |
… | …1000101100111101 |
3 | 22021002122011120222 |
4 | 2332303220230331 |
5 | 23024002111401 |
6 | 1245352551125 |
7 | 142220545211 |
oct | 27663505475 |
9 | 8232564528 |
10 | 3201207101 |
11 | 13a2aa8304 |
12 | 7540b24a5 |
13 | 3c02a20b1 |
14 | 225220941 |
15 | 13b08ac1b |
hex | bece8b3d |
3201207101 has 2 divisors, whose sum is σ = 3201207102. Its totient is φ = 3201207100.
The previous prime is 3201207071. The next prime is 3201207109. The reversal of 3201207101 is 1017021023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3054772900 + 146434201 = 55270^2 + 12101^2 .
It is an emirp because it is prime and its reverse (1017021023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3201207101 - 214 = 3201190717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3201207101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3201207109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1600603550 + 1600603551.
It is an arithmetic number, because the mean of its divisors is an integer number (1600603551).
Almost surely, 23201207101 is an apocalyptic number.
It is an amenable number.
3201207101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3201207101 is an equidigital number, since it uses as much as digits as its factorization.
3201207101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 3201207101 is about 56579.2108552249. The cubic root of 3201207101 is about 1473.7978677503.
Adding to 3201207101 its reverse (1017021023), we get a palindrome (4218228124).
The spelling of 3201207101 in words is "three billion, two hundred one million, two hundred seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •