Search a number
-
+
160051056953 is a prime number
BaseRepresentation
bin1001010100001111001…
…0010101000100111001
3120022010020022002222012
42111003302111010321
510110241032310303
6201305413335305
714364133352204
oct2250362250471
9508106262865
10160051056953
1161971715a97
1227028937535
1312128a05138
147a6460493b
15426b1c55d8
hex2543c95139

160051056953 has 2 divisors, whose sum is σ = 160051056954. Its totient is φ = 160051056952.

The previous prime is 160051056947. The next prime is 160051056983. The reversal of 160051056953 is 359650150061.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 117863129344 + 42187927609 = 343312^2 + 205397^2 .

It is a cyclic number.

It is not a de Polignac number, because 160051056953 - 24 = 160051056937 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 160051056953.

It is not a weakly prime, because it can be changed into another prime (160051056943) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80025528476 + 80025528477.

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

Almost surely, 2160051056953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 121500, while the sum is 41.

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