Search a number
-
+
103130100213 = 3713935330627
BaseRepresentation
bin110000000001100001…
…0000111000111110101
3100212012022110220112020
41200003002013013311
53142202301201323
6115213255543353
710310442250050
oct1400302070765
9325168426466
10103130100213
113a812286788
1217ba208ab59
13995714624a
144dc4a51a97
152a38e2bae3
hex18030871f5

103130100213 has 16 divisors (see below), whose sum is σ = 158281213440. Its totient is φ = 58507516656.

The previous prime is 103130100181. The next prime is 103130100221. The reversal of 103130100213 is 312001031301.

It is not a de Polignac number, because 103130100213 - 25 = 103130100181 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (103130100263) 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, 17662395 + ... + 17668232.

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

Almost surely, 2103130100213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35330776.

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

Adding to 103130100213 its reverse (312001031301), we get a palindrome (415131131514).

The spelling of 103130100213 in words is "one hundred three billion, one hundred thirty million, one hundred thousand, two hundred thirteen".

Divisors: 1 3 7 21 139 417 973 2919 35330627 105991881 247314389 741943167 4910957153 14732871459 34376700071 103130100213