Base | Representation |
---|---|
bin | 1111101001101001… |
… | …1011011101001001 |
3 | 101211210100201010122 |
4 | 3322122123131021 |
5 | 32101003412301 |
6 | 1532514553025 |
7 | 206052612245 |
oct | 37232333511 |
9 | 11753321118 |
10 | 4201232201 |
11 | 1866538a31 |
12 | 992b98775 |
13 | 51c51a81a |
14 | 2bbd77425 |
15 | 198c7481b |
hex | fa69b749 |
4201232201 has 2 divisors, whose sum is σ = 4201232202. Its totient is φ = 4201232200.
The previous prime is 4201232159. The next prime is 4201232207. The reversal of 4201232201 is 1022321024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3923143225 + 278088976 = 62635^2 + 16676^2 .
It is a cyclic number.
It is not a de Polignac number, because 4201232201 - 214 = 4201215817 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4201232201.
It is not a weakly prime, because it can be changed into another prime (4201232207) 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, 2100616100 + 2100616101.
It is an arithmetic number, because the mean of its divisors is an integer number (2100616101).
Almost surely, 24201232201 is an apocalyptic number.
It is an amenable number.
4201232201 is a deficient number, since it is larger than the sum of its proper divisors (1).
4201232201 is an equidigital number, since it uses as much as digits as its factorization.
4201232201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 4201232201 is about 64816.9129240201. The cubic root of 4201232201 is about 1613.5864138025.
Adding to 4201232201 its reverse (1022321024), we get a palindrome (5223553225).
The spelling of 4201232201 in words is "four billion, two hundred one million, two hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •