Search a number
-
+
13100151104 = 26204689861
BaseRepresentation
bin11000011001101010…
…00111000101000000
31020210222020121221122
430030311013011000
5203312114313404
610003525411412
7642430306235
oct141465070500
936728217848
1013100151104
11561276a467
122657269b68
13130a069201
148c3b9978c
1551a1363be
hex30cd47140

13100151104 has 14 divisors (see below), whose sum is σ = 25995612474. Its totient is φ = 6550075520.

The previous prime is 13100151041. The next prime is 13100151107. The reversal of 13100151104 is 40115100131.

It can be written as a sum of positive squares in only one way, i.e., 6814832704 + 6285318400 = 82552^2 + 79280^2 .

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

It is a congruent number.

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

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 as a sum of consecutive naturals, namely, 102344867 + ... + 102344994.

Almost surely, 213100151104 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

Adding to 13100151104 its reverse (40115100131), we get a palindrome (53215251235).

The spelling of 13100151104 in words is "thirteen billion, one hundred million, one hundred fifty-one thousand, one hundred four".

Divisors: 1 2 4 8 16 32 64 204689861 409379722 818759444 1637518888 3275037776 6550075552 13100151104