Search a number
-
+
151056361 = 191790871
BaseRepresentation
bin10010000000011…
…10111111101001
3101112020110101001
421000032333221
5302132300421
622553355001
73512646361
oct1100167751
9345213331
10151056361
11782a3975
1242708a61
13253ab981
14160c19a1
15d3dc691
hex900efe9

151056361 has 4 divisors (see below), whose sum is σ = 151847424. Its totient is φ = 150265300.

The previous prime is 151056359. The next prime is 151056371. The reversal of 151056361 is 163650151.

151056361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 151056361 - 21 = 151056359 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2151056361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 791062.

The product of its (nonzero) digits is 2700, while the sum is 28.

The square root of 151056361 is about 12290.4988100565. The cubic root of 151056361 is about 532.5736470100.

The spelling of 151056361 in words is "one hundred fifty-one million, fifty-six thousand, three hundred sixty-one".

Divisors: 1 191 790871 151056361