Search a number
-
+
110021021517 = 31189310912049
BaseRepresentation
bin110011001110111000…
…0111000111101001101
3101111222112221222110210
41212131300320331031
53300310340142032
6122313140153033
710643265152451
oct1463560707515
9344875858423
10110021021517
1142728aa8970
12193a5998779
13a4b497a284
145479cd6661
152cddd9b2cc
hex199dc38f4d

110021021517 has 32 divisors (see below), whose sum is σ = 161894160000. Its totient is φ = 65903523840.

The previous prime is 110021021503. The next prime is 110021021521. The reversal of 110021021517 is 715120120011.

It is not a de Polignac number, because 110021021517 - 27 = 110021021389 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 110021021493 and 110021021502.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110021021557) 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, 9125109 + ... + 9137157.

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

Almost surely, 2110021021517 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15261.

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

Adding to 110021021517 its reverse (715120120011), we get a palindrome (825141141528).

The spelling of 110021021517 in words is "one hundred ten billion, twenty-one million, twenty-one thousand, five hundred seventeen".

Divisors: 1 3 11 33 89 267 979 2937 3109 9327 12049 34199 36147 102597 132539 276701 397617 830103 1072361 3043711 3217083 9131133 11795971 35387913 37460341 112381023 412063751 1236191253 3333970349 10001911047 36673673839 110021021517