Base | Representation |
---|---|
bin | 1001010000101010110… |
… | …1011001011000000001 |
3 | 120012122111102021101001 |
4 | 2110022231121120001 |
5 | 10101310411300104 |
6 | 201030405012001 |
7 | 14331325055551 |
oct | 2241255313001 |
9 | 505574367331 |
10 | 159093462529 |
11 | 61520126141 |
12 | 26a000b4001 |
13 | 120054c4711 |
14 | 79b3375161 |
15 | 42120bdaa4 |
hex | 250ab59601 |
159093462529 has 4 divisors (see below), whose sum is σ = 159099162160. Its totient is φ = 159087762900.
The previous prime is 159093462511. The next prime is 159093462553. The reversal of 159093462529 is 925264390951.
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: 925264390951 = 50329 ⋅18384319.
It is a cyclic number.
It is not a de Polignac number, because 159093462529 - 213 = 159093454337 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 159093462529.
It is not an unprimeable number, because it can be changed into a prime (159093462029) 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, 2807739 + ... + 2863840.
It is an arithmetic number, because the mean of its divisors is an integer number (39774790540).
Almost surely, 2159093462529 is an apocalyptic number.
It is an amenable number.
159093462529 is a deficient number, since it is larger than the sum of its proper divisors (5699631).
159093462529 is an equidigital number, since it uses as much as digits as its factorization.
159093462529 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5699630.
The product of its (nonzero) digits is 5248800, while the sum is 55.
The spelling of 159093462529 in words is "one hundred fifty-nine billion, ninety-three million, four hundred sixty-two thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •