Search a number
-
+
16905770 = 257241511
BaseRepresentation
bin100000001111…
…1011000101010
31011210220100122
41000133120222
513311441040
61402203242
7263460650
oct100373052
934726318
1016905770
1195a7612
1257b3522
13366bc1b
142360dd0
15173e1b5
hex101f62a

16905770 has 16 divisors (see below), whose sum is σ = 34777728. Its totient is φ = 5796240.

The previous prime is 16905767. The next prime is 16905773. The reversal of 16905770 is 7750961.

It is an interprime number because it is at equal distance from previous prime (16905767) and next prime (16905773).

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

It is a self number, because there is not a number n which added to its sum of digits gives 16905770.

It is not an unprimeable number, because it can be changed into a prime (16905773) 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 7 ways as a sum of consecutive naturals, for example, 120686 + ... + 120825.

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

Almost surely, 216905770 is an apocalyptic number.

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

16905770 is an abundant number, since it is smaller than the sum of its proper divisors (17871958).

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

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

The sum of its prime factors is 241525.

The product of its (nonzero) digits is 13230, while the sum is 35.

The square root of 16905770 is about 4111.6626807169. The cubic root of 16905770 is about 256.6521964819.

The spelling of 16905770 in words is "sixteen million, nine hundred five thousand, seven hundred seventy".

Divisors: 1 2 5 7 10 14 35 70 241511 483022 1207555 1690577 2415110 3381154 8452885 16905770