Search a number
-
+
11697103051 = 47263946291
BaseRepresentation
bin10101110010011001…
…11010000011001011
31010012012011101211221
422321030322003023
5142423424244201
65212405302511
7562602510154
oct127114720313
933165141757
1011697103051
114a62789717
122325404a37
13114549126a
147cd6d292b
15486d8d4a1
hex2b933a0cb

11697103051 has 8 divisors (see below), whose sum is σ = 11991412224. Its totient is φ = 11404687080.

The previous prime is 11697102979. The next prime is 11697103063. The reversal of 11697103051 is 15030179611.

11697103051 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 a cyclic number.

It is not a de Polignac number, because 11697103051 - 215 = 11697070283 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11697102998 and 11697103016.

It is not an unprimeable number, because it can be changed into a prime (11697101051) 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, 460785 + ... + 485506.

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

Almost surely, 211697103051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 946601.

The product of its (nonzero) digits is 5670, while the sum is 34.

The spelling of 11697103051 in words is "eleven billion, six hundred ninety-seven million, one hundred three thousand, fifty-one".

Divisors: 1 47 263 12361 946291 44475677 248874533 11697103051