Search a number
-
+
4661224241 is a prime number
BaseRepresentation
bin1000101011101010…
…01010001100110001
3110000211220201120212
410111311022030301
534021233133431
62050310113505
7223336516022
oct42565121461
913024821525
104661224241
111a82159843
12aa104b895
1359390556b
143230b6c49
151c433872b
hex115d4a331

4661224241 has 2 divisors, whose sum is σ = 4661224242. Its totient is φ = 4661224240.

The previous prime is 4661224207. The next prime is 4661224301. The reversal of 4661224241 is 1424221664.

4661224241 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., 4537369600 + 123854641 = 67360^2 + 11129^2 .

It is a cyclic number.

It is not a de Polignac number, because 4661224241 - 26 = 4661224177 is a prime.

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

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

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

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

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

Almost surely, 24661224241 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 4661224241 is about 68273.1590085006. The cubic root of 4661224241 is about 1670.4494279659.

The spelling of 4661224241 in words is "four billion, six hundred sixty-one million, two hundred twenty-four thousand, two hundred forty-one".