Search a number
-
+
150561363151 = 307490427893
BaseRepresentation
bin1000110000111000101…
…0000001010011001111
3112101121212202201100101
42030032022001103033
54431322202110101
6153100020311531
713610023320343
oct2141612012317
9471555681311
10150561363151
1158941a67641
122521a8425a7
131127596aac4
14740415b623
153db3019401
hex230e2814cf

150561363151 has 4 divisors (see below), whose sum is σ = 151051791352. Its totient is φ = 150070934952.

The previous prime is 150561363131. The next prime is 150561363157. The reversal of 150561363151 is 151363165051.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151363165051 = 721623309293.

It is a cyclic number.

It is not a de Polignac number, because 150561363151 - 27 = 150561363023 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 150561363151.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (150561363157) 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, 245213640 + ... + 245214253.

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

Almost surely, 2150561363151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 490428200.

The product of its (nonzero) digits is 40500, while the sum is 37.

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

Divisors: 1 307 490427893 150561363151