Search a number
-
+
121011120112 = 247563195007
BaseRepresentation
bin111000010110011010…
…0110010011111110000
3102120100110202211112111
41300230310302133300
53440312321320422
6131331452135104
711512524356311
oct1605464623760
9376313684474
10121011120112
1147358693683
121b552467494
13b546818bac
145bdd74a608
153233b31a77
hex1c2cd327f0

121011120112 has 10 divisors (see below), whose sum is σ = 234459045248. Its totient is φ = 60505560048.

The previous prime is 121011120091. The next prime is 121011120143. The reversal of 121011120112 is 211021110121.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 3781597488 + ... + 3781597519.

Almost surely, 2121011120112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 121011120112 its reverse (211021110121), we get a palindrome (332032230233).

Subtracting 121011120112 from its reverse (211021110121), we obtain a palindrome (90009990009).

The spelling of 121011120112 in words is "one hundred twenty-one billion, eleven million, one hundred twenty thousand, one hundred twelve".

Divisors: 1 2 4 8 16 7563195007 15126390014 30252780028 60505560056 121011120112