Base | Representation |
---|---|
bin | 1001010000101011101… |
… | …0101010100100000001 |
3 | 120012122201221222122221 |
4 | 2110022322222210001 |
5 | 10101312304101201 |
6 | 201031011331041 |
7 | 14331366453361 |
oct | 2241272524401 |
9 | 505581858587 |
10 | 159096940801 |
11 | 61522091447 |
12 | 26a012b0a81 |
13 | 12006141976 |
14 | 79b39dc9a1 |
15 | 42125594a1 |
hex | 250aeaa901 |
159096940801 has 4 divisors (see below), whose sum is σ = 159097928704. Its totient is φ = 159095952900.
The previous prime is 159096940789. The next prime is 159096940813. The reversal of 159096940801 is 108049690951.
It is a happy number.
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 a brilliant number, because the two primes have the same length.
It is an interprime number because it is at equal distance from previous prime (159096940789) and next prime (159096940813).
It is a cyclic number.
It is not a de Polignac number, because 159096940801 - 213 = 159096932609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (159096940841) 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, 190065 + ... + 595246.
It is an arithmetic number, because the mean of its divisors is an integer number (39774482176).
Almost surely, 2159096940801 is an apocalyptic number.
It is an amenable number.
159096940801 is a deficient number, since it is larger than the sum of its proper divisors (987903).
159096940801 is an equidigital number, since it uses as much as digits as its factorization.
159096940801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 987902.
The product of its (nonzero) digits is 699840, while the sum is 52.
The spelling of 159096940801 in words is "one hundred fifty-nine billion, ninety-six million, nine hundred forty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •