Search a number
-
+
4101577013 is a prime number
BaseRepresentation
bin1111010001111001…
…0001100100110101
3101120211211200220202
43310132101210311
531400000431023
61514555010245
7203432554322
oct36436214465
911524750822
104101577013
111815262576
12965739985
13504997c61
142aca35b49
1519013c128
hexf4791935

4101577013 has 2 divisors, whose sum is σ = 4101577014. Its totient is φ = 4101577012.

The previous prime is 4101576991. The next prime is 4101577031. The reversal of 4101577013 is 3107751014.

Together with next prime (4101577031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2443621489 + 1657955524 = 49433^2 + 40718^2 .

It is a cyclic number.

It is not a de Polignac number, because 4101577013 - 226 = 4034468149 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 24101577013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2940, while the sum is 29.

The square root of 4101577013 is about 64043.5555930493. Note that the first 4 decimals coincide. The cubic root of 4101577013 is about 1600.7258442368.

The spelling of 4101577013 in words is "four billion, one hundred one million, five hundred seventy-seven thousand, thirteen".