Search a number
-
+
691266 = 23115211
BaseRepresentation
bin10101000110001000010
31022010020110
42220301002
5134110031
622452150
75606232
oct2506102
91263213
10691266
114323a4
12294056
131b2844
1413dcc2
15d9c46
hexa8c42

691266 has 8 divisors (see below), whose sum is σ = 1382544. Its totient is φ = 230420.

The previous prime is 691241. The next prime is 691267. The reversal of 691266 is 662196.

It is a sphenic number, since it is the product of 3 distinct primes.

691266 is an admirable number.

It is a Curzon number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 691266.

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

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

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

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

2691266 is an apocalyptic number.

691266 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 115216.

The product of its digits is 3888, while the sum is 30.

The square root of 691266 is about 831.4240795166. The cubic root of 691266 is about 88.4195700685.

Subtracting from 691266 its product of digits (3888), we obtain a triangular number (687378 = T1172).

The spelling of 691266 in words is "six hundred ninety-one thousand, two hundred sixty-six".

Divisors: 1 2 3 6 115211 230422 345633 691266