Search a number
-
+
11011110122002 = 247117139469383
BaseRepresentation
bin1010000000111011100101…
…0011101011001000010010
31102222122121012022100112111
42200032321103223020102
52420401223142401002
635230233440015534
72214345400516504
oct240167123531022
942878535270474
1011011110122002
113565870672021
12129a03a6015aa
1361b4600c7443
142a0d24d0dd74
15141656c4c3d7
hexa03b94eb212

11011110122002 has 8 divisors (see below), whose sum is σ = 16868083591296. Its totient is φ = 5388415591572.

The previous prime is 11011110121987. The next prime is 11011110122009. The reversal of 11011110122002 is 20022101111011.

It is a happy number.

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

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

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

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

Almost surely, 211011110122002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 117139469432.

The product of its (nonzero) digits is 8, while the sum is 13.

Adding to 11011110122002 its reverse (20022101111011), we get a palindrome (31033211233013).

The spelling of 11011110122002 in words is "eleven trillion, eleven billion, one hundred ten million, one hundred twenty-two thousand, two".

Divisors: 1 2 47 94 117139469383 234278938766 5505555061001 11011110122002