Search a number
-
+
151510560101 = 1071415986543
BaseRepresentation
bin1000110100011010111…
…0111010110101100101
3112111002000211220202222
42031012232322311211
54440243200410401
6153334125042125
713642400340365
oct2150656726545
9474060756688
10151510560101
115928984132a
12254446b6345
13113974cb1c4
1474942429a5
153e1b512c1b
hex2346bbad65

151510560101 has 4 divisors (see below), whose sum is σ = 152926546752. Its totient is φ = 150094573452.

The previous prime is 151510560067. The next prime is 151510560161. The reversal of 151510560101 is 101065015151.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 101065015151 = 271357372443.

It is a cyclic number.

It is not a de Polignac number, because 151510560101 - 234 = 134330690917 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 (151510560161) 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, 707993165 + ... + 707993378.

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

Almost surely, 2151510560101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1415986650.

The product of its (nonzero) digits is 750, while the sum is 26.

Adding to 151510560101 its reverse (101065015151), we get a palindrome (252575575252).

The spelling of 151510560101 in words is "one hundred fifty-one billion, five hundred ten million, five hundred sixty thousand, one hundred one".

Divisors: 1 107 1415986543 151510560101