Search a number
-
+
150151695 = 3510010113
BaseRepresentation
bin10001111001100…
…10001000001111
3101110112111101220
420330302020033
5301414323240
622522134423
73502161021
oct1074621017
9343474356
10150151695
1177836211
1242351413
1325152c75
1415d28011
15d2ae5d0
hex8f3220f

150151695 has 8 divisors (see below), whose sum is σ = 240242736. Its totient is φ = 80080896.

The previous prime is 150151663. The next prime is 150151721. The reversal of 150151695 is 596151051.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 150151695 - 25 = 150151663 is a prime.

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

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 5005042 + ... + 5005071.

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

Almost surely, 2150151695 is an apocalyptic number.

150151695 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10010121.

The product of its (nonzero) digits is 6750, while the sum is 33.

The square root of 150151695 is about 12253.6400714237. The cubic root of 150151695 is about 531.5083353487.

The spelling of 150151695 in words is "one hundred fifty million, one hundred fifty-one thousand, six hundred ninety-five".

Divisors: 1 3 5 15 10010113 30030339 50050565 150151695