Search a number
-
+
11700031161052 = 2213225000599251
BaseRepresentation
bin1010101001000010000000…
…1100111000001011011100
31112102111211021210012222101
42222100200030320023130
53013143130434123202
640514530424454444
72315204451652363
oct252204014701334
945374737705871
1011700031161052
113800a56631343
12138b66491a424
1366b401181590
142c63daa6c7da
15154528369887
hexaa4203382dc

11700031161052 has 12 divisors (see below), whose sum is σ = 22050058726696. Its totient is φ = 5400014382000.

The previous prime is 11700031161037. The next prime is 11700031161061. The reversal of 11700031161052 is 25016113000711.

It is a super-2 number, since 2×117000311610522 (a number of 27 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 11700031161052.

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 112500299574 + ... + 112500299677.

Almost surely, 211700031161052 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 225000599268 (or 225000599266 counting only the distinct ones).

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

Adding to 11700031161052 its reverse (25016113000711), we get a palindrome (36716144161763).

The spelling of 11700031161052 in words is "eleven trillion, seven hundred billion, thirty-one million, one hundred sixty-one thousand, fifty-two".

Divisors: 1 2 4 13 26 52 225000599251 450001198502 900002397004 2925007790263 5850015580526 11700031161052