Search a number
-
+
106515132321 = 3134995473261
BaseRepresentation
bin110001100110011001…
…0111110111110100001
3101011221020000100121210
41203030302332332201
53221120333213241
6120533220540333
710460354454243
oct1431462767641
9334836010553
10106515132321
114119a019484
12187878516a9
13a07652b220
145226444093
152b861c9316
hex18cccbefa1

106515132321 has 16 divisors (see below), whose sum is σ = 153251336000. Its totient is φ = 65416403520.

The previous prime is 106515132319. The next prime is 106515132329. The reversal of 106515132321 is 123231515601.

It is not a de Polignac number, because 106515132321 - 21 = 106515132319 is a prime.

It is a super-2 number, since 2×1065151323212 (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 (106515132329) by changing a digit.

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

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

Almost surely, 2106515132321 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5473776.

The product of its (nonzero) digits is 5400, while the sum is 30.

Adding to 106515132321 its reverse (123231515601), we get a palindrome (229746647922).

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

Divisors: 1 3 13 39 499 1497 6487 19461 5473261 16419783 71152393 213457179 2731157239 8193471717 35505044107 106515132321