Search a number
-
+
5021305211143 = 132297168155963
BaseRepresentation
bin100100100010001110100…
…0111010000100100000111
3122210000212101121222202101
41021010131013100210013
51124232113113224033
614402431125052531
71025530424032264
oct111043507204407
918700771558671
105021305211143
111666583982a81
126911b4b57147
132a5678caca90
1413506514826b
158a937d5b97d
hex4911d1d0907

5021305211143 has 8 divisors (see below), whose sum is σ = 5409913673808. Its totient is φ = 4633033065024.

The previous prime is 5021305211137. The next prime is 5021305211173. The reversal of 5021305211143 is 3411125031205.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 5021305211143 - 213 = 5021305202951 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5021305211173) 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 in 7 ways as a sum of consecutive naturals, for example, 84048121 + ... + 84107842.

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

Almost surely, 25021305211143 is an apocalyptic number.

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

5021305211143 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 168158273.

The product of its (nonzero) digits is 3600, while the sum is 28.

The spelling of 5021305211143 in words is "five trillion, twenty-one billion, three hundred five million, two hundred eleven thousand, one hundred forty-three".

Divisors: 1 13 2297 29861 168155963 2186027519 386254247011 5021305211143