Search a number
-
+
103010131111 = 8323339713417
BaseRepresentation
bin101111111101111100…
…0011101110010100111
3100211212221201211212011
41133323320131302213
53141431043143421
6115153332335051
710304454444646
oct1377370356247
9324787654764
10103010131111
113a760596168
1217b69a74487
139938330404
144db2b4335d
152a2d6304e1
hex17fbe1dca7

103010131111 has 16 divisors (see below), whose sum is σ = 104970194784. Its totient is φ = 101069489664.

The previous prime is 103010131069. The next prime is 103010131127. The reversal of 103010131111 is 111131010301.

It is a cyclic number.

It is not a de Polignac number, because 103010131111 - 211 = 103010129063 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7670875 + ... + 7684291.

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

Almost surely, 2103010131111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14130.

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

Adding to 103010131111 its reverse (111131010301), we get a palindrome (214141141412).

The spelling of 103010131111 in words is "one hundred three billion, ten million, one hundred thirty-one thousand, one hundred eleven".

Divisors: 1 83 233 397 13417 19339 32951 92501 1113611 3126161 5326549 7677583 259471363 442103567 1241085917 103010131111