Search a number
-
+
101315136761 = 1950391058221
BaseRepresentation
bin101111001011011011…
…0100100110011111001
3100200111211022012201122
41132112312210303321
53124443133334021
6114313222555025
710214453311316
oct1362666446371
9320454265648
10101315136761
1139a70831893
1217776298a75
139728117387
144c919a1d0d
15297e919bab
hex1796da4cf9

101315136761 has 8 divisors (see below), whose sum is σ = 106668777600. Its totient is φ = 95963622480.

The previous prime is 101315136757. The next prime is 101315136877. The reversal of 101315136761 is 167631513101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 101315136761 - 22 = 101315136757 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 433370 + ... + 624851.

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

Almost surely, 2101315136761 is an apocalyptic number.

It is an amenable number.

101315136761 is a deficient number, since it is larger than the sum of its proper divisors (5353640839).

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

101315136761 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1063279.

The product of its (nonzero) digits is 11340, while the sum is 35.

Adding to 101315136761 its reverse (167631513101), we get a palindrome (268946649862).

The spelling of 101315136761 in words is "one hundred one billion, three hundred fifteen million, one hundred thirty-six thousand, seven hundred sixty-one".

Divisors: 1 19 5039 95741 1058221 20106199 5332375619 101315136761