Search a number
-
+
1131200211022 = 2780800015073
BaseRepresentation
bin10000011101100000110…
…010010110100001001110
311000010211021202201002221
4100131200302112201032
5122013144223223042
62223355522205554
7144504124100620
oct20354062264116
94003737681087
101131200211022
113a6815035362
121632987b38ba
1382896a098bb
143ca71098c10
151e659b57d67
hex10760c9684e

1131200211022 has 8 divisors (see below), whose sum is σ = 1939200361776. Its totient is φ = 484800090432.

The previous prime is 1131200210963. The next prime is 1131200211061. The reversal of 1131200211022 is 2201120021311.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 1131200210987 and 1131200211005.

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, 40400007523 + ... + 40400007550.

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

Almost surely, 21131200211022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 80800015082.

The product of its (nonzero) digits is 48, while the sum is 16.

Adding to 1131200211022 its reverse (2201120021311), we get a palindrome (3332320232333).

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

Divisors: 1 2 7 14 80800015073 161600030146 565600105511 1131200211022