Search a number
-
+
141443230361 is a prime number
BaseRepresentation
bin1000001110111010101…
…1000110101010011001
3111112002102101120121112
42003232223012222121
54304133431332421
6144551135150105
713135044422666
oct2035653065231
9445072346545
10141443230361
1154a9301a504
12234b5075335
1310451898764
146bbb194a6d
153a2c7a545b
hex20eeac6a99

141443230361 has 2 divisors, whose sum is σ = 141443230362. Its totient is φ = 141443230360.

The previous prime is 141443230267. The next prime is 141443230363. The reversal of 141443230361 is 163032344141.

141443230361 is digitally balanced in base 2, 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., 136933302025 + 4509928336 = 370045^2 + 67156^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-141443230361 is a prime.

Together with 141443230363, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2141443230361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20736, while the sum is 32.

The spelling of 141443230361 in words is "one hundred forty-one billion, four hundred forty-three million, two hundred thirty thousand, three hundred sixty-one".