Search a number
-
+
101315725742 = 271119234173503
BaseRepresentation
bin101111001011011100…
…0110100100110101110
3100200111212102010122202
41132112320310212232
53124443311210432
6114313243341502
710214461313420
oct1362670644656
9320455363582
10101315725742
1139a710a4350
1217776521892
13972829249a
144c91ab6810
15297e9d4462
hex1796e349ae

101315725742 has 256 divisors, whose sum is σ = 216543559680. Its totient is φ = 34351257600.

The previous prime is 101315725691. The next prime is 101315725747. The reversal of 101315725742 is 247527513101.

101315725742 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a super-2 number, since 2×1013157257422 (a number of 23 digits) contains 22 as substring.

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 201422663 + ... + 201423165.

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

Almost surely, 2101315725742 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 679.

The product of its (nonzero) digits is 58800, while the sum is 38.

The spelling of 101315725742 in words is "one hundred one billion, three hundred fifteen million, seven hundred twenty-five thousand, seven hundred forty-two".