Search a number
-
+
151204510161 = 335600167043
BaseRepresentation
bin1000110011010001111…
…1011011100111010001
3112110021200221222012000
42030310133123213101
54434131323311121
6153243513224213
713631663062455
oct2146437334721
9473250858160
10151204510161
11591420054a1
122537a102069
1311348c92773
147465736665
153dee70b526
hex23347db9d1

151204510161 has 8 divisors (see below), whose sum is σ = 224006681760. Its totient is φ = 100803006756.

The previous prime is 151204510129. The next prime is 151204510181. The reversal of 151204510161 is 161015402151.

151204510161 is a `hidden beast` number, since 1 + 51 + 2 + 0 + 451 + 0 + 161 = 666.

It is not a de Polignac number, because 151204510161 - 25 = 151204510129 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 5600167043 = 151204510161 / (1 + 5 + 1 + 2 + 0 + 4 + 5 + 1 + 0 + 1 + 6 + 1).

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

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

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

Almost surely, 2151204510161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5600167052 (or 5600167046 counting only the distinct ones).

The product of its (nonzero) digits is 1200, while the sum is 27.

The spelling of 151204510161 in words is "one hundred fifty-one billion, two hundred four million, five hundred ten thousand, one hundred sixty-one".

Divisors: 1 3 9 27 5600167043 16800501129 50401503387 151204510161