Search a number
-
+
10651040705 = 53757573193
BaseRepresentation
bin10011110101101100…
…11111101111000001
31000111021210221002002
421322312133233001
5133303131300310
64520520433345
7524641231544
oct117266375701
930437727062
1010651040705
114576264588
122093018855
131009847066
147307d485b
1542510dda5
hex27ad9fbc1

10651040705 has 8 divisors (see below), whose sum is σ = 13126688232. Its totient is φ = 8290539648.

The previous prime is 10651040641. The next prime is 10651040707. The reversal of 10651040705 is 50704015601.

It can be written as a sum of positive squares in 4 ways, for example, as 5091250609 + 5559790096 = 71353^2 + 74564^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10651040705 - 26 = 10651040641 is a prime.

It is a super-3 number, since 3×106510407053 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28786412 + ... + 28786781.

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

Almost surely, 210651040705 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 57573235.

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

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

Divisors: 1 5 37 185 57573193 287865965 2130208141 10651040705