Search a number
-
+
10695636007 = 73137487073
BaseRepresentation
bin10011111011000001…
…00111010000100111
31000121101201121022221
421331200213100213
5133401040323012
64525152333211
7526022256160
oct117540472047
930541647287
1010695636007
114599453701
1220a5b44207
131015b5c404
147366c2767
15428ebc507
hex27d827427

10695636007 has 8 divisors (see below), whose sum is σ = 12227505696. Its totient is φ = 9164746752.

The previous prime is 10695636001. The next prime is 10695636041. The reversal of 10695636007 is 70063659601.

10695636007 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 10695636007 - 23 = 10695635999 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210695636007 is an apocalyptic number.

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

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

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

The sum of its prime factors is 490217.

The product of its (nonzero) digits is 204120, while the sum is 43.

The spelling of 10695636007 in words is "ten billion, six hundred ninety-five million, six hundred thirty-six thousand, seven".

Divisors: 1 7 3137 21959 487073 3409511 1527948001 10695636007