Search a number
-
+
151056161601 = 350352053867
BaseRepresentation
bin1000110010101110100…
…1100001101101000001
3112102220100211002012220
42030223221201231001
54433330334132401
6153221053441253
713625212121412
oct2145351415501
9472810732186
10151056161601
11590762a0a84
12253384a0229
1311324321457
14744db5b809
153de16a6336
hex232ba61b41

151056161601 has 4 divisors (see below), whose sum is σ = 201408215472. Its totient is φ = 100704107732.

The previous prime is 151056161591. The next prime is 151056161629. The reversal of 151056161601 is 106161650151.

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, and also an emirpimes, since its reverse is a distinct semiprime: 106161650151 = 335387216717.

It is a cyclic number.

It is not a de Polignac number, because 151056161601 - 226 = 150989052737 is a prime.

It is not an unprimeable number, because it can be changed into a prime (151056161651) 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 in 3 ways as a sum of consecutive naturals, for example, 25176026931 + ... + 25176026936.

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

Almost surely, 2151056161601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 50352053870.

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

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

Divisors: 1 3 50352053867 151056161601