Search a number
-
+
3913210061 is a prime number
BaseRepresentation
bin1110100100111110…
…1101100011001101
3101002201101200000222
43221033231203031
531003240210221
61444145401125
7165654510455
oct35117554315
911081350028
103913210061
1117289a5702
129126391a5
134a4954917
14291a00d65
1517d82e9ab
hexe93ed8cd

3913210061 has 2 divisors, whose sum is σ = 3913210062. Its totient is φ = 3913210060.

The previous prime is 3913210057. The next prime is 3913210121. The reversal of 3913210061 is 1600123193.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2165133961 + 1748076100 = 46531^2 + 41810^2 .

It is a cyclic number.

It is not a de Polignac number, because 3913210061 - 22 = 3913210057 is a prime.

It is a super-4 number, since 4×39132100614 (a number of 39 digits) contains 4444 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 3913210061.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (3913210031) 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, 1956605030 + 1956605031.

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

Almost surely, 23913210061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 26.

The square root of 3913210061 is about 62555.6557075377. The cubic root of 3913210061 is about 1575.8361309612.

The spelling of 3913210061 in words is "three billion, nine hundred thirteen million, two hundred ten thousand, sixty-one".