Search a number
-
+
151000701 = 350333567
BaseRepresentation
bin10010000000000…
…01011001111101
3101112010122000120
421000001121331
5302124010301
622552245153
73512325165
oct1100013175
9345118016
10151000701
1178266075
12426a07b9
132538c537
14160a95a5
15d3cae36
hex900167d

151000701 has 4 divisors (see below), whose sum is σ = 201334272. Its totient is φ = 100667132.

The previous prime is 151000621. The next prime is 151000723. The reversal of 151000701 is 107000151.

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.

It is a cyclic number.

It is not a de Polignac number, because 151000701 - 29 = 151000189 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2151000701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 50333570.

The product of its (nonzero) digits is 35, while the sum is 15.

The square root of 151000701 is about 12288.2342506969. The cubic root of 151000701 is about 532.5082261949.

Adding to 151000701 its reverse (107000151), we get a palindrome (258000852).

The spelling of 151000701 in words is "one hundred fifty-one million, seven hundred one", and thus it is an aban number.

Divisors: 1 3 50333567 151000701