Search a number
-
+
101684758855680 = 2143115721113
BaseRepresentation
bin10111000111101101010011…
…111011100100000000000000
3111100000222010200100000000000
4113013231103323210000000
5101312000341231340210
61000133200000000000
730263324055135600
oct2707552373440000
9440028120300000
10101684758855680
112a44429a504420
12b4a3230000000
134497aa70a0a10
141b177d62c6c00
15bb50c2043ac0
hex5c7b53ee4000

101684758855680 has 4320 divisors, whose sum is σ = 500260615021440. Its totient is φ = 19503969730560.

The previous prime is 101684758855637. The next prime is 101684758855681. The reversal of 101684758855680 is 86558857486101.

101684758855680 is a `hidden beast` number, since 1 + 0 + 1 + 6 + 8 + 4 + 7 + 58 + 8 + 5 + 568 + 0 = 666.

It is a tau number, because it is divible by the number of its divisors (4320).

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

It is a junction number, because it is equal to n+sod(n) for n = 101684758855599 and 101684758855608.

It is a congruent number.

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

It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 7821904527354 + ... + 7821904527366.

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

Almost surely, 2101684758855680 is an apocalyptic number.

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

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

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

101684758855680 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 516096000, while the sum is 72.

The spelling of 101684758855680 in words is "one hundred one trillion, six hundred eighty-four billion, seven hundred fifty-eight million, eight hundred fifty-five thousand, six hundred eighty".