Search a number
-
+
862149013152 = 25372839194933
BaseRepresentation
bin11001000101111000001…
…01011110111010100000
310001102100122110201120120
430202330011132322200
5103111140121410102
61500022113240240
7116200566461130
oct14427405367240
93042318421516
10862149013152
113026a9707189
1211b10bb63080
13633b99c587b
142da2a3c2ac0
151765e53e6bc
hexc8bc15eea0

862149013152 has 192 divisors, whose sum is σ = 2598937528320. Its totient is φ = 245141074944.

The previous prime is 862149013133. The next prime is 862149013157. The reversal of 862149013152 is 251310941268.

It is a Harshad number since it is a multiple of its sum of digits (42).

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

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

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 103680, while the sum is 42.

The spelling of 862149013152 in words is "eight hundred sixty-two billion, one hundred forty-nine million, thirteen thousand, one hundred fifty-two".