Search a number
-
+
10405610507 = 12781933941
BaseRepresentation
bin10011011000011100…
…10000010000001011
3222212011222210010202
421230032100100023
5132302314014012
64440312202415
7515601141605
oct115416202013
928764883122
1010405610507
11445a772206
12202499940b
13c9aa446a6
14709d88175
1540d7cdcc2
hex26c39040b

10405610507 has 4 divisors (see below), whose sum is σ = 10487544576. Its totient is φ = 10323676440.

The previous prime is 10405610503. The next prime is 10405610513. The reversal of 10405610507 is 70501650401.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10405610507 - 22 = 10405610503 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10405610507.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 210405610507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 81934068.

The product of its (nonzero) digits is 4200, while the sum is 29.

The spelling of 10405610507 in words is "ten billion, four hundred five million, six hundred ten thousand, five hundred seven".

Divisors: 1 127 81933941 10405610507