Search a number
-
+
10641110505 = 352975132573
BaseRepresentation
bin10011110100100001…
…00111010111101001
31000110121010102101220
421322100213113221
5133243111014010
64515523532253
7524460642534
oct117220472751
930417112356
1010641110505
1145706a1903
12208b82a089
13100777b1bc
1472d36ba1b
154242eb970
hex27a4275e9

10641110505 has 32 divisors (see below), whose sum is σ = 17636866560. Its totient is φ = 5472096000.

The previous prime is 10641110489. The next prime is 10641110549. The reversal of 10641110505 is 50501114601.

It is not a de Polignac number, because 10641110505 - 24 = 10641110489 is a prime.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 310399 + ... + 342971.

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

Almost surely, 210641110505 is an apocalyptic number.

10641110505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

10641110505 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 33361.

The product of its (nonzero) digits is 600, while the sum is 24.

The spelling of 10641110505 in words is "ten billion, six hundred forty-one million, one hundred ten thousand, five hundred five".

Divisors: 1 3 5 15 29 87 145 435 751 2253 3755 11265 21779 32573 65337 97719 108895 162865 326685 488595 944617 2833851 4723085 14169255 24462323 73386969 122311615 366934845 709407367 2128222101 3547036835 10641110505