Search a number
-
+
142604000 = 2553711463
BaseRepresentation
bin10000111111111…
…11011011100000
3100221100000220122
420133333123200
5243001312000
622052255412
73351054050
oct1037773340
9327300818
10142604000
1173550550
123b911568
132370c686
1414d21560
15c7bd085
hex87ff6e0

142604000 has 192 divisors, whose sum is σ = 437778432. Its totient is φ = 44352000.

The previous prime is 142603931. The next prime is 142604017. The reversal of 142604000 is 406241.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 307769 + ... + 308231.

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

Almost surely, 2142604000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 192, while the sum is 17.

The square root of 142604000 is about 11941.6916724558. The cubic root of 142604000 is about 522.4490003106.

The spelling of 142604000 in words is "one hundred forty-two million, six hundred four thousand".