Search a number
-
+
101530151 = 505120101
BaseRepresentation
bin1100000110100…
…11101000100111
321002001021011222
412003103220213
5201442431101
614024050555
72341664162
oct603235047
9232037158
10101530151
1152347118
122a003a5b
131805b118
14d6acad9
158da801b
hex60d3a27

101530151 has 4 divisors (see below), whose sum is σ = 101555304. Its totient is φ = 101505000.

The previous prime is 101530147. The next prime is 101530193. The reversal of 101530151 is 151035101.

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 101530151 - 22 = 101530147 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2101530151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 25152.

The product of its (nonzero) digits is 75, while the sum is 17.

The square root of 101530151 is about 10076.2170977009. The cubic root of 101530151 is about 466.5143537508.

Adding to 101530151 its reverse (151035101), we get a palindrome (252565252).

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

Divisors: 1 5051 20101 101530151