Search a number
-
+
61000133 is a prime number
BaseRepresentation
bin1110100010110…
…0100111000101
311020210010110012
43220230213011
5111104001013
610015240005
71340330645
oct350544705
9136703405
1061000133
1131484337
1218519005
13c83a26c
14815c525
15554e1a8
hex3a2c9c5

61000133 has 2 divisors, whose sum is σ = 61000134. Its totient is φ = 61000132.

The previous prime is 61000111. The next prime is 61000139. The reversal of 61000133 is 33100016.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 42484324 + 18515809 = 6518^2 + 4303^2 .

It is a cyclic number.

It is not a de Polignac number, because 61000133 - 210 = 60999109 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 261000133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 14.

The square root of 61000133 is about 7810.2581903545. The cubic root of 61000133 is about 393.6500044052.

Adding to 61000133 its reverse (33100016), we get a palindrome (94100149).

It can be divided in two parts, 6100013 and 3, that added together give a palindrome (6100016).

The spelling of 61000133 in words is "sixty-one million, one hundred thirty-three", and thus it is an aban number.