Search a number
-
+
159295810091 = 11115031258927
BaseRepresentation
bin1001010001011011000…
…1010010101000101011
3120020011121011121001012
42110112301102220223
510102214211410331
6201102434014135
714336333021255
oct2242661225053
9506147147035
10159295810091
1161614371930
1226a57a1734b
13120383c13c2
1479d21a8cd5
154224c3d82b
hex2516c52a2b

159295810091 has 8 divisors (see below), whose sum is σ = 173792492544. Its totient is φ = 144801668520.

The previous prime is 159295810049. The next prime is 159295810109. The reversal of 159295810091 is 190018592951.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 159295810091 - 222 = 159291615787 is a prime.

It is a super-2 number, since 2×1592958100912 (a number of 23 digits) contains 22 as substring.

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

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

Almost surely, 2159295810091 is an apocalyptic number.

159295810091 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

159295810091 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1270441.

The product of its (nonzero) digits is 291600, while the sum is 50.

The spelling of 159295810091 in words is "one hundred fifty-nine billion, two hundred ninety-five million, eight hundred ten thousand, ninety-one".

Divisors: 1 11 11503 126533 1258927 13848197 14481437281 159295810091