Search a number
-
+
105468515737 = 1379102695731
BaseRepresentation
bin110001000111001101…
…0011101010110011001
3101002020021121201120121
41202032122131112121
53211444420000422
6120241312153241
710422415410034
oct1421632352631
9332207551517
10105468515737
11408022559a2
1218535238821
139c3a74b980
14516744001b
152b2438a8c7
hex188e69d599

105468515737 has 8 divisors (see below), whose sum is σ = 115019219840. Its totient is φ = 96123203280.

The previous prime is 105468515707. The next prime is 105468515771. The reversal of 105468515737 is 737515864501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 105468515737 - 27 = 105468515609 is a prime.

It is a super-2 number, since 2×1054685157372 (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 (105468515707) 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 7 ways as a sum of consecutive naturals, for example, 51346839 + ... + 51348892.

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

Almost surely, 2105468515737 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 102695823.

The product of its (nonzero) digits is 3528000, while the sum is 52.

The spelling of 105468515737 in words is "one hundred five billion, four hundred sixty-eight million, five hundred fifteen thousand, seven hundred thirty-seven".

Divisors: 1 13 79 1027 102695731 1335044503 8112962749 105468515737