Search a number
-
+
49597014356032 = 26111321060739301
BaseRepresentation
bin10110100011011101101000…
…11011000011000001000000
320111121102120012120110120211
423101232310123003001000
523000044141133343112
6253252315344243504
713306160152105543
oct1321566433030100
9214542505513524
1049597014356032
1114891a80681240
125690297910594
132189c94688900
14c36718ad885a
155b01eb0ab0a7
hex2d1bb46c3040

49597014356032 has 168 divisors, whose sum is σ = 116274429977472. Its totient is φ = 20807444736000.

The previous prime is 49597014356017. The next prime is 49597014356039. The reversal of 49597014356032 is 23065341079594.

It is not an unprimeable number, because it can be changed into a prime (49597014356039) 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 23 ways as a sum of consecutive naturals, for example, 1261958782 + ... + 1261998082.

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

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

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

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

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

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

The product of its (nonzero) digits is 24494400, while the sum is 58.

The spelling of 49597014356032 in words is "forty-nine trillion, five hundred ninety-seven billion, fourteen million, three hundred fifty-six thousand, thirty-two".