Search a number
-
+
4691113241 is a prime number
BaseRepresentation
bin1000101111001110…
…01011010100011001
3110002221011020120212
410113213023110121
534101411110431
62053254500505
7224151542663
oct42747132431
913087136525
104691113241
111a980138a1
12aab064735
13599b6bb69
14327057533
151c6c8e72b
hex1179cb519

4691113241 has 2 divisors, whose sum is σ = 4691113242. Its totient is φ = 4691113240.

The previous prime is 4691113211. The next prime is 4691113253. The reversal of 4691113241 is 1423111964.

4691113241 is digitally balanced in base 3, 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., 4659427600 + 31685641 = 68260^2 + 5629^2 .

It is a cyclic number.

It is not a de Polignac number, because 4691113241 - 218 = 4690851097 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 4691113198 and 4691113207.

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

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

Almost surely, 24691113241 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5184, while the sum is 32.

The square root of 4691113241 is about 68491.7019864450. The cubic root of 4691113241 is about 1674.0122776680.

The spelling of 4691113241 in words is "four billion, six hundred ninety-one million, one hundred thirteen thousand, two hundred forty-one".