Search a number
-
+
111201112012 = 22149379492293
BaseRepresentation
bin110011110010000011…
…0100100111111001100
3101122000210111210022011
41213210012210333030
53310214441041022
6123030213431004
711014444566514
oct1474406447714
9348023453264
10111201112012
1143184146371
121967503b464
13a6422c0583
14554c922844
152d5c7a2977
hex19e41a4fcc

111201112012 has 24 divisors (see below), whose sum is σ = 196425306000. Its totient is φ = 55081567296.

The previous prime is 111201111979. The next prime is 111201112031. The reversal of 111201112012 is 210211102111.

It is a happy number.

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

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 in 7 ways as a sum of consecutive naturals, for example, 20263 + ... + 472030.

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

Almost surely, 2111201112012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 111201112012 its reverse (210211102111), we get a palindrome (321412214123).

Subtracting 111201112012 from its reverse (210211102111), we obtain a palindrome (99009990099).

The spelling of 111201112012 in words is "one hundred eleven billion, two hundred one million, one hundred twelve thousand, twelve".

Divisors: 1 2 4 149 298 379 596 758 1516 56471 112942 225884 492293 984586 1969172 73351657 146703314 186579047 293406628 373158094 746316188 27800278003 55600556006 111201112012