Search a number
-
+
101013110131 = 718971158591
BaseRepresentation
bin101111000010011011…
…0011011110101110011
3100122201202222200002011
41132010312123311303
53123333324011011
6114223233303351
710204125161233
oct1360466336563
9318652880064
10101013110131
11399262a37aa
12176b1104b57
1396aa689cab
144c63821cc3
15296315a621
hex1784d9bd73

101013110131 has 8 divisors (see below), whose sum is σ = 102447894528. Its totient is φ = 99578661000.

The previous prime is 101013110111. The next prime is 101013110147. The reversal of 101013110131 is 131011310101.

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 101013110131 - 217 = 101012979059 is a prime.

It is a super-2 number, since 2×1010131101312 (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 (101013110111) 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, 557646 + ... + 716236.

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

Almost surely, 2101013110131 is an apocalyptic number.

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

101013110131 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 167633.

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 101013110131 its reverse (131011310101), we get a palindrome (232024420232).

The spelling of 101013110131 in words is "one hundred one billion, thirteen million, one hundred ten thousand, one hundred thirty-one".

Divisors: 1 71 8971 158591 636941 11259961 1422719861 101013110131