Search a number
-
+
90509107200 = 213352413593
BaseRepresentation
bin101010001001011000…
…0110110000000000000
322122121201212000220120
41110102300312000000
52440330312412300
6105325044140240
76352620501051
oct1242260660000
9278551760816
1090509107200
1135426038946
121565b397680
1386c5445745
144548784728
15254ade33a0
hex1512c36000

90509107200 has 336 divisors, whose sum is σ = 306649654416. Its totient is φ = 23540531200.

The previous prime is 90509107187. The next prime is 90509107223. The reversal of 90509107200 is 270190509.

It is a super-2 number, since 2×905091072002 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

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 23 ways as a sum of consecutive naturals, for example, 25188604 + ... + 25192196.

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

Almost surely, 290509107200 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 90509107200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153324827208).

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

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

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 33.

Adding to 90509107200 its reverse (270190509), we get a palindrome (90779297709).

The spelling of 90509107200 in words is "ninety billion, five hundred nine million, one hundred seven thousand, two hundred".