Search a number
-
+
12010102011110 = 257171572885873
BaseRepresentation
bin1010111011000101000111…
…0111010011010011100110
31120112011011122210102212002
42232301101313103103212
53033233142103323420
641313210435125302
72346462344463650
oct256612167232346
946464148712762
1012010102011110
113910501534315
12141b77aa43832
13691717576058
142d74134d76d0
1515c624c2e075
hexaec51dd34e6

12010102011110 has 16 divisors (see below), whose sum is σ = 24706495565856. Its totient is φ = 4117749260928.

The previous prime is 12010102011077. The next prime is 12010102011133. The reversal of 12010102011110 is 1111020101021.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85786442867 + ... + 85786443006.

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

Almost surely, 212010102011110 is an apocalyptic number.

12010102011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

12010102011110 is an abundant number, since it is smaller than the sum of its proper divisors (12696393554746).

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

12010102011110 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 171572885887.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 12010102011110 its reverse (1111020101021), we get a palindrome (13121122112131).

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

Divisors: 1 2 5 7 10 14 35 70 171572885873 343145771746 857864429365 1201010201111 1715728858730 2402020402222 6005051005555 12010102011110