Search a number
-
+
139827609600 = 2213527127
BaseRepresentation
bin1000001000111001100…
…0000000000000000000
3111100220211022112120120
42002032120000000000
54242331332001400
6144122542540240
713050026033250
oct2021630000000
9440824275516
10139827609600
1154334049738
1223123b97680
1310254c53943
146aa6795960
153985a1cca0
hex208e600000

139827609600 has 528 divisors, whose sum is σ = 532575817728. Its totient is φ = 31708938240.

The previous prime is 139827609599. The next prime is 139827609629. The reversal of 139827609600 is 6906728931.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2139827609600 is an apocalyptic number.

139827609600 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 139827609600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (266287908864).

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

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

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

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

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

The product of its (nonzero) digits is 979776, while the sum is 51.

The spelling of 139827609600 in words is "one hundred thirty-nine billion, eight hundred twenty-seven million, six hundred nine thousand, six hundred".