Search a number
-
+
1090209950 = 25289409599
BaseRepresentation
bin100000011111011…
…0100100010011110
32210222102101220022
41000332310202132
54213043204300
6300102552142
736005426444
oct10076644236
92728371808
101090209950
1150a438965
12265138652
13144b3385b
14a4b10b94
1565aa0285
hex40fb489e

1090209950 has 48 divisors (see below), whose sum is σ = 2059020000. Its totient is φ = 429411840.

The previous prime is 1090209931. The next prime is 1090209961. The reversal of 1090209950 is 599020901.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1819751 + ... + 1820349.

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

Almost surely, 21090209950 is an apocalyptic number.

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

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

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

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

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

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

The square root of 1090209950 is about 33018.3274864128. The cubic root of 1090209950 is about 1029.2085383115.

The spelling of 1090209950 in words is "one billion, ninety million, two hundred nine thousand, nine hundred fifty".

Divisors: 1 2 5 10 25 50 89 178 409 445 599 818 890 1198 2045 2225 2995 4090 4450 5990 10225 14975 20450 29950 36401 53311 72802 106622 182005 244991 266555 364010 489982 533110 910025 1224955 1332775 1820050 2449910 2665550 6124775 12249550 21804199 43608398 109020995 218041990 545104975 1090209950