Search a number
-
+
105515305221 = 335171768407
BaseRepresentation
bin110001001000100110…
…0111100100100000101
3101002100112122212200110
41202101030330210011
53212043404231341
6120250103103233
710423524203364
oct1422114744405
9332315585613
10105515305221
1140826703597
1218548a41b19
139c47351961
14516d73d7db
152b2852e216
hex189133c905

105515305221 has 4 divisors (see below), whose sum is σ = 140687073632. Its totient is φ = 70343536812.

The previous prime is 105515305199. The next prime is 105515305253. The reversal of 105515305221 is 122503515501.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 122503515501 = 340834505167.

It is not a de Polignac number, because 105515305221 - 221 = 105513208069 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17585884201 + ... + 17585884206.

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

Almost surely, 2105515305221 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35171768410.

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

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

Divisors: 1 3 35171768407 105515305221