Search a number
-
+
103110011313 = 31031312547247
BaseRepresentation
bin110000000000111010…
…1011110100110110001
3100212010220200021201220
41200001311132212301
53142132130330223
6115211301215253
710310106430611
oct1400165364661
9325126607656
10103110011313
113a801a05691
1217b97401529
139952c3151a
144dc2102a41
152a372ae6e3
hex1801d5e9b1

103110011313 has 16 divisors (see below), whose sum is σ = 139874482176. Its totient is φ = 67552963920.

The previous prime is 103110011273. The next prime is 103110011321. The reversal of 103110011313 is 313110011301.

It is not a de Polignac number, because 103110011313 - 229 = 102573140401 is a prime.

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

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

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

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

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

Almost surely, 2103110011313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2547484.

The product of its (nonzero) digits is 27, while the sum is 15.

Adding to 103110011313 its reverse (313110011301), we get a palindrome (416220022614).

The spelling of 103110011313 in words is "one hundred three billion, one hundred ten million, eleven thousand, three hundred thirteen".

Divisors: 1 3 103 131 309 393 13493 40479 2547247 7641741 262366441 333689357 787099323 1001068071 34370003771 103110011313