Search a number
-
+
101420111 = 1345367
BaseRepresentation
bin1100000101110…
…00110001001111
321001211200020102
412002320301033
5201430420421
614021441315
72341025312
oct602706117
9231750212
10101420111
1152281481
1229b7023b
1318020000
14d680979
158d8560b
hex60b8c4f

101420111 has 20 divisors (see below), whose sum is σ = 113615352. Its totient is φ = 90481248.

The previous prime is 101420093. The next prime is 101420117. The reversal of 101420111 is 111024101.

It is not a de Polignac number, because 101420111 - 218 = 101157967 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101420117) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1513700 + ... + 1513766.

Almost surely, 2101420111 is an apocalyptic number.

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

101420111 is an frugal number, since it uses more digits than its factorization.

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

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

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

The square root of 101420111 is about 10070.7552348372. The cubic root of 101420111 is about 466.3457542555.

Adding to 101420111 its reverse (111024101), we get a palindrome (212444212).

The spelling of 101420111 in words is "one hundred one million, four hundred twenty thousand, one hundred eleven".

Divisors: 1 13 53 67 169 689 871 2197 3551 8957 11323 28561 46163 116441 147199 600119 1513733 1913587 7801547 101420111