Search a number
-
+
306909 = 36421
BaseRepresentation
bin1001010111011011101
3120121000000
41022323131
534310114
610324513
72415531
oct1127335
9517000
10306909
1119a649
12129739
13a9905
147dbc1
1560e09
hex4aedd

306909 has 14 divisors (see below), whose sum is σ = 461246. Its totient is φ = 204120.

The previous prime is 306899. The next prime is 306913. The reversal of 306909 is 909603.

It can be written as a sum of positive squares in only one way, i.e., 164025 + 142884 = 405^2 + 378^2 .

It is not a de Polignac number, because 306909 - 24 = 306893 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a d-powerful number, because it can be written as 39 + 0 + 93 + 67 + 0 + 94 .

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 519 + ... + 939.

2306909 is an apocalyptic number.

It is an amenable number.

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

306909 is an frugal number, since it uses more digits than its factorization.

306909 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 439 (or 424 counting only the distinct ones).

The product of its (nonzero) digits is 1458, while the sum is 27.

The square root of 306909 is about 553.9936822744. The cubic root of 306909 is about 67.4533010327.

Adding to 306909 its sum of digits (27), we get a triangular number (306936 = T783).

The spelling of 306909 in words is "three hundred six thousand, nine hundred nine".

Divisors: 1 3 9 27 81 243 421 729 1263 3789 11367 34101 102303 306909