[go: up one dir, main page]

Search a number
-
+
10690995 = 357293511
BaseRepresentation
bin101000110010…
…000110110011
3202010011021210
4220302012303
510214102440
61021051203
7156605040
oct50620663
922104253
1010690995
116042337
1236b6b03
1322a4243
1415c41c7
15e12a80
hexa321b3

10690995 has 32 divisors (see below), whose sum is σ = 20229120. Its totient is φ = 4717440.

The previous prime is 10690963. The next prime is 10690997. The reversal of 10690995 is 59909601.

It is not a de Polignac number, because 10690995 - 25 = 10690963 is a prime.

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

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1290 + ... + 4800.

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

Almost surely, 210690995 is an apocalyptic number.

10690995 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

10690995 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 3555.

The product of its (nonzero) digits is 21870, while the sum is 39.

The square root of 10690995 is about 3269.7087026217. The cubic root of 10690995 is about 220.2957111597.

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

Divisors: 1 3 5 7 15 21 29 35 87 105 145 203 435 609 1015 3045 3511 10533 17555 24577 52665 73731 101819 122885 305457 368655 509095 712733 1527285 2138199 3563665 10690995