Search a number
-
+
10692649731 = 34578778893
BaseRepresentation
bin10011111010101010…
…01110001100000011
31000121012002212221010
421331111032030003
5133344304242411
64525004332003
7525655010631
oct117525161403
930535085833
1010692649731
1145977a4005
1220a4b44003
13101535509a
14736146351
15428acc7a6
hex27d54e303

10692649731 has 16 divisors (see below), whose sum is σ = 14305963424. Its totient is φ = 7103925504.

The previous prime is 10692649727. The next prime is 10692649733. The reversal of 10692649731 is 13794629601.

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

It is not a de Polignac number, because 10692649731 - 22 = 10692649727 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10692649733) 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 15 ways as a sum of consecutive naturals, for example, 1197921 + ... + 1206813.

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

Almost surely, 210692649731 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10230.

The product of its (nonzero) digits is 489888, while the sum is 48.

The spelling of 10692649731 in words is "ten billion, six hundred ninety-two million, six hundred forty-nine thousand, seven hundred thirty-one".

Divisors: 1 3 457 877 1371 2631 8893 26679 400789 1202367 4064101 7799161 12192303 23397483 3564216577 10692649731