Search a number
-
+
103215061145 = 5717173470691
BaseRepresentation
bin110000000100000011…
…0001101100010011001
3100212102020100101000102
41200020012031202121
53142341023424040
6115225532545145
710312523354420
oct1401006154231
9325366311012
10103215061145
113a856236129
12180066221b5
13996b9226a1
144dd204a2b7
152a41610515
hex180818d899

103215061145 has 16 divisors (see below), whose sum is σ = 149878677888. Its totient is φ = 66612744960.

The previous prime is 103215061123. The next prime is 103215061171. The reversal of 103215061145 is 541160512301.

It is not a de Polignac number, because 103215061145 - 214 = 103215044761 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 86734751 + ... + 86735940.

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

Almost surely, 2103215061145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 173470720.

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

Adding to 103215061145 its reverse (541160512301), we get a palindrome (644375573446).

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

Divisors: 1 5 7 17 35 85 119 595 173470691 867353455 1214294837 2949001747 6071474185 14745008735 20643012229 103215061145