Search a number
-
+
1168271005002 = 23194711834167
BaseRepresentation
bin10001000000000010011…
…000001101010101001010
311010200111211000011100120
4101000002120031111022
5123120104334130002
62252410222044110
7150255562460313
oct21000230152512
94120454004316
101168271005002
11410508586582
1216a503719636
1386223c6395a
144078a60b60a
15205c93d1cbc
hex1100260d54a

1168271005002 has 8 divisors (see below), whose sum is σ = 2336542010016. Its totient is φ = 389423668332.

The previous prime is 1168271004941. The next prime is 1168271005007. The reversal of 1168271005002 is 2005001728611.

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

1168271005002 is an admirable number.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 21168271005002 is an apocalyptic number.

1168271005002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 194711834172.

The product of its (nonzero) digits is 6720, while the sum is 33.

The spelling of 1168271005002 in words is "one trillion, one hundred sixty-eight billion, two hundred seventy-one million, five thousand, two".

Divisors: 1 2 3 6 194711834167 389423668334 584135502501 1168271005002