Search a number
-
+
143163615661213 = 720451945094459
BaseRepresentation
bin100000100011010011100000…
…011101001100110010011101
3200202220022022112020120210111
4200203103200131030302131
5122231043041102124323
61224252242422010021
742104141566516540
oct4043234035146235
9622808275216714
10143163615661213
1141686391855944
1214082099276911
1361b636a5b1904
14274d227da2857
151184032d24c0d
hex8234e074cc9d

143163615661213 has 4 divisors (see below), whose sum is σ = 163615560755680. Its totient is φ = 122711670566748.

The previous prime is 143163615661193. The next prime is 143163615661229. The reversal of 143163615661213 is 312166516361341.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 143163615661213 - 225 = 143163582106781 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (143163615661813) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10225972547223 + ... + 10225972547236.

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

Almost surely, 2143163615661213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 20451945094466.

The product of its digits is 1399680, while the sum is 49.

The spelling of 143163615661213 in words is "one hundred forty-three trillion, one hundred sixty-three billion, six hundred fifteen million, six hundred sixty-one thousand, two hundred thirteen".

Divisors: 1 7 20451945094459 143163615661213