Search a number
-
+
103215062125 = 537140983719
BaseRepresentation
bin110000000100000011…
…0001101110001101101
3100212102020100102100201
41200020012031301231
53142341023442000
6115225532553501
710312523360320
oct1401006156155
9325366312321
10103215062125
113a85623693a
1218006622891
13996b922c76
144dd204a7b7
152a4161096a
hex180818dc6d

103215062125 has 32 divisors (see below), whose sum is σ = 147320409600. Its totient is φ = 70724966400.

The previous prime is 103215062107. The next prime is 103215062141. The reversal of 103215062125 is 521260512301.

It is not a de Polignac number, because 103215062125 - 29 = 103215061613 is a prime.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1191016 + ... + 1274734.

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

Almost surely, 2103215062125 is an apocalyptic number.

It is an amenable number.

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

103215062125 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 3600, while the sum is 28.

Adding to 103215062125 its reverse (521260512301), we get a palindrome (624475574426).

The spelling of 103215062125 in words is "one hundred three billion, two hundred fifteen million, sixty-two thousand, one hundred twenty-five".

Divisors: 1 5 7 25 35 125 175 875 1409 7045 9863 35225 49315 83719 176125 246575 418595 586033 1232875 2092975 2930165 10464875 14650825 73254125 117960071 589800355 825720497 2949001775 4128602485 14745008875 20643012425 103215062125