Search a number
-
+
10690913397 = 33563637799
BaseRepresentation
bin10011111010011101…
…00110010001110101
31000121001211200010110
421331032212101311
5133343333212042
64524503213233
7525634156503
oct117516462165
930531750113
1010690913397
11459681851a
1220a4447219
131014b97978
14735c13673
1542888809c
hex27d3a6475

10690913397 has 4 divisors (see below), whose sum is σ = 14254551200. Its totient is φ = 7127275596.

The previous prime is 10690913381. The next prime is 10690913411. The reversal of 10690913397 is 79331909601.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 10690913397 - 24 = 10690913381 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 210690913397 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3563637802.

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

The spelling of 10690913397 in words is "ten billion, six hundred ninety million, nine hundred thirteen thousand, three hundred ninety-seven".

Divisors: 1 3 3563637799 10690913397