Search a number
-
+
101396714496 = 21037211219293
BaseRepresentation
bin101111001101110110…
…1110001010000000000
3100200201111210210100020
41132123231301100000
53130130024330441
6114325255253440
710216463565300
oct1363355612000
9320644723306
10101396714496
113a002890400
121779967a280
13973bcaa91c
144c9c759600
152986b80e66
hex179bb71400

101396714496 has 792 divisors, whose sum is σ = 364990580640. Its totient is φ = 24865505280.

The previous prime is 101396714459. The next prime is 101396714509. The reversal of 101396714496 is 694417693101.

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 71 ways as a sum of consecutive naturals, for example, 346063726 + ... + 346064018.

Almost surely, 2101396714496 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 101396714496 in words is "one hundred one billion, three hundred ninety-six million, seven hundred fourteen thousand, four hundred ninety-six".