Search a number
-
+
103215052513 = 31531011075813
BaseRepresentation
bin110000000100000011…
…0001011011011100001
3100212102020022221011201
41200020012023123201
53142341023140023
6115225532441201
710312523320306
oct1401006133341
9325366287151
10103215052513
113a85622a6a1
1218006619201
13996b91b791
144dd20470ad
152a4160cbad
hex180818b6e1

103215052513 has 32 divisors (see below), whose sum is σ = 110673257472. Its totient is φ = 96107232000.

The previous prime is 103215052459. The next prime is 103215052531. The reversal of 103215052513 is 315250512301.

It is not a de Polignac number, because 103215052513 - 29 = 103215052001 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 2103215052513 is an apocalyptic number.

It is an amenable number.

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

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

103215052513 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 6105.

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

Adding to 103215052513 its reverse (315250512301), we get a palindrome (418465564814).

The spelling of 103215052513 in words is "one hundred three billion, two hundred fifteen million, fifty-two thousand, five hundred thirteen".

Divisors: 1 31 53 101 107 1643 3131 3317 5353 5671 5813 10807 165943 175801 180203 308089 335017 572771 587113 621991 9550759 17755901 18200503 19281721 31116989 32965523 62821091 964626659 1021931213 1947453821 3329517823 103215052513