Search a number
-
+
100311515013 = 3314799224759
BaseRepresentation
bin101110101101100001…
…0000011111110000101
3100120220212210221111210
41131123002003332011
53120414221440023
6114025451522033
710150545544353
oct1353302037605
9316825727453
10100311515013
11395a6264a26
1217536159319
1395c820c858
144bd85907d3
152921770593
hex175b083f85

100311515013 has 16 divisors (see below), whose sum is σ = 138092544000. Its totient is φ = 64703333040.

The previous prime is 100311515009. The next prime is 100311515041. The reversal of 100311515013 is 310515113001.

It is not a de Polignac number, because 100311515013 - 22 = 100311515009 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2100311515013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 229592.

The product of its (nonzero) digits is 225, while the sum is 21.

Adding to 100311515013 its reverse (310515113001), we get a palindrome (410826628014).

It can be divided in two parts, 100 and 311515013, that added together give a palindrome (311515113).

The spelling of 100311515013 in words is "one hundred billion, three hundred eleven million, five hundred fifteen thousand, thirteen".

Divisors: 1 3 31 93 4799 14397 148769 224759 446307 674277 6967529 20902587 1078618441 3235855323 33437171671 100311515013