Search a number
-
+
10005691 = 11938387
BaseRepresentation
bin100110001010…
…110010111011
3200211100020011
4212022302323
510030140231
6554242351
7151022053
oct46126273
920740204
1010005691
115714473
1234263b7
1320c4337
141486563
15d299b1
hex98acbb

10005691 has 4 divisors (see below), whose sum is σ = 10015272. Its totient is φ = 9996112.

The previous prime is 10005683. The next prime is 10005703. The reversal of 10005691 is 19650001.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 10005691 - 23 = 10005683 is a prime.

It is a super-2 number, since 2×100056912 = 200227704774962, which contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 210005691 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9580.

The product of its (nonzero) digits is 270, while the sum is 22.

The square root of 10005691 is about 3163.1773582902. The cubic root of 10005691 is about 215.4843308787.

Adding to 10005691 its reverse (19650001), we get a palindrome (29655692).

The spelling of 10005691 in words is "ten million, five thousand, six hundred ninety-one".

Divisors: 1 1193 8387 10005691