Search a number
-
+
101513131 = 812312497
BaseRepresentation
bin1100000110011…
…11011110101011
321002000101211121
412003033132223
5201441410011
614023440111
72341563436
oct603173653
9232011747
10101513131
1152335355
1229bb6037
1318053455
14d6a681d
158da2e71
hex60cf7ab

101513131 has 4 divisors (see below), whose sum is σ = 101533752. Its totient is φ = 101492512.

The previous prime is 101513123. The next prime is 101513141. The reversal of 101513131 is 131315101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 101513131 - 23 = 101513123 is a prime.

It is a super-2 number, since 2×1015131312 = 20609831530846322, which contains 22 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1875 + ... + 14371.

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

Almost surely, 2101513131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20620.

The product of its (nonzero) digits is 45, while the sum is 16.

The square root of 101513131 is about 10075.3724993173. The cubic root of 101513131 is about 466.4882842600.

Adding to 101513131 its reverse (131315101), we get a palindrome (232828232).

The spelling of 101513131 in words is "one hundred one million, five hundred thirteen thousand, one hundred thirty-one".

Divisors: 1 8123 12497 101513131