Search a number
-
+
150302630651 = 1935571398151
BaseRepresentation
bin1000101111111010111…
…1000010001011111011
3112100221211220202002012
42023332233002023323
54430304433140101
6153014215000135
713600432165235
oct2137657021373
9470854822065
10150302630651
1158819a0a028
122516806904b
131123418b754
1473bba4b255
153d9a45cbbb
hex22febc22fb

150302630651 has 8 divisors (see below), whose sum is σ = 151352750304. Its totient is φ = 149255308800.

The previous prime is 150302630641. The next prime is 150302630671. The reversal of 150302630651 is 156036203051.

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 150302630651 - 234 = 133122761467 is a prime.

It is a super-2 number, since 2×1503026306512 (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 (150302630641) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 591575 + ... + 806576.

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

Almost surely, 2150302630651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1398901.

The product of its (nonzero) digits is 16200, while the sum is 32.

The spelling of 150302630651 in words is "one hundred fifty billion, three hundred two million, six hundred thirty thousand, six hundred fifty-one".

Divisors: 1 193 557 107501 1398151 269843143 778770107 150302630651