Search a number
-
+
1168370824519 is a prime number
BaseRepresentation
bin10001000000001000010…
…100111111010101000111
311010200202202211111222201
4101000020110333111013
5123120310412341034
62252424145335331
7150261214101313
oct21001024772507
94120682744881
101168370824519
11410559964448
1216a531037547
138623b843262
1440799992b43
15205d304d014
hex1100853f547

1168370824519 has 2 divisors, whose sum is σ = 1168370824520. Its totient is φ = 1168370824518.

The previous prime is 1168370824507. The next prime is 1168370824553. The reversal of 1168370824519 is 9154280738611.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1168370824519 - 27 = 1168370824391 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1168370824519.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1168370822519) 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 as a sum of consecutive naturals, namely, 584185412259 + 584185412260.

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

It is a 1-persistent number, because it is pandigital, but 2⋅1168370824519 = 2336741649038 is not.

Almost surely, 21168370824519 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2903040, while the sum is 55.

The spelling of 1168370824519 in words is "one trillion, one hundred sixty-eight billion, three hundred seventy million, eight hundred twenty-four thousand, five hundred nineteen".