Search a number
-
+
13590108000 = 2532537199271
BaseRepresentation
bin11001010100000100…
…01001011101100000
31022002010012000110100
430222002021131200
5210313031424000
610124311102400
7660530004060
oct145202113540
938063160410
1013590108000
115844297317
122773371a00
131387715c31
1492cc993a0
15548168a00
hex32a089760

13590108000 has 576 divisors, whose sum is σ = 55602892800. Its totient is φ = 3079296000.

The previous prime is 13590107987. The next prime is 13590108001. The reversal of 13590108000 is 80109531.

It is a congruent number.

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

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 50147865 + ... + 50148135.

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

Almost surely, 213590108000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

The spelling of 13590108000 in words is "thirteen billion, five hundred ninety million, one hundred eight thousand".