Search a number
-
+
6032132201 is a prime number
BaseRepresentation
bin1011001111000101…
…10000100001101001
3120120101112001202202
411213202300201221
544323211212301
62434321305545
7302324164154
oct54742604151
916511461682
106032132201
112615a88227
1212041952b5
137519393c4
144131b4c9b
1525488366b
hex1678b0869

6032132201 has 2 divisors, whose sum is σ = 6032132202. Its totient is φ = 6032132200.

The previous prime is 6032132189. The next prime is 6032132251. The reversal of 6032132201 is 1022312306.

It is a happy number.

6032132201 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5783754601 + 248377600 = 76051^2 + 15760^2 .

It is a cyclic number.

It is not a de Polignac number, because 6032132201 - 230 = 4958390377 is a prime.

It is a super-2 number, since 2×60321322012 = 72773237780682208802, which contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (6032132251) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3016066100 + 3016066101.

It is an arithmetic number, because the mean of its divisors is an integer number (3016066101).

Almost surely, 26032132201 is an apocalyptic number.

It is an amenable number.

6032132201 is a deficient number, since it is larger than the sum of its proper divisors (1).

6032132201 is an equidigital number, since it uses as much as digits as its factorization.

6032132201 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 432, while the sum is 20.

The square root of 6032132201 is about 77666.8024383649. The cubic root of 6032132201 is about 1820.3586019023.

Adding to 6032132201 its reverse (1022312306), we get a palindrome (7054444507).

The spelling of 6032132201 in words is "six billion, thirty-two million, one hundred thirty-two thousand, two hundred one".