Search a number
-
+
476433113141 is a prime number
BaseRepresentation
bin1101110111011011010…
…00000110000000110101
31200112202102221211002002
412323231220012000311
530301213334110031
61002511555025045
746264312433366
oct6735550060065
91615672854062
10476433113141
111740660875a7
127840459b185
1335c097b7ccb
14190b932bb6d
15c5d6b96ccb
hex6eeda06035

476433113141 has 2 divisors, whose sum is σ = 476433113142. Its totient is φ = 476433113140.

The previous prime is 476433113059. The next prime is 476433113201. The reversal of 476433113141 is 141311334674.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 455537254225 + 20895858916 = 674935^2 + 144554^2 .

It is a cyclic number.

It is not a de Polignac number, because 476433113141 - 210 = 476433112117 is a prime.

It is a super-2 number, since 2×4764331131412 (a number of 24 digits) contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 2476433113141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 72576, while the sum is 38.

The spelling of 476433113141 in words is "four hundred seventy-six billion, four hundred thirty-three million, one hundred thirteen thousand, one hundred forty-one".