Search a number
-
+
63195059136 = 26311219612347
BaseRepresentation
bin111010110110101110…
…000001001111000000
320001010011122121220210
4322312232001033000
52013410413343021
645010441234120
74365014065626
oct726656011700
9201104577823
1063195059136
1124889a66300
12102b7a92940
135c61688b21
1430b6d53516
15199cec6e76
hexeb6b813c0

63195059136 has 336 divisors, whose sum is σ = 196713937280. Its totient is φ = 17837107200.

The previous prime is 63195059131. The next prime is 63195059189.

63195059136 is nontrivially palindromic in base 10.

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

It is a congruent number.

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

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 47 ways as a sum of consecutive naturals, for example, 26924715 + ... + 26927061.

Almost surely, 263195059136 is an apocalyptic number.

63195059136 is a gapful number since it is divisible by the number (66) 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 63195059136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98356968640).

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

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

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

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

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

The product of its (nonzero) digits is 656100, while the sum is 48.

The spelling of 63195059136 in words is "sixty-three billion, one hundred ninety-five million, fifty-nine thousand, one hundred thirty-six".