Base | Representation |
---|---|
bin | 10011000010010… |
… | …11000100110001 |
3 | 102010111010221121 |
4 | 21201023010301 |
5 | 311340103212 |
6 | 23502422241 |
7 | 3646231411 |
oct | 1141130461 |
9 | 363433847 |
10 | 159691057 |
11 | 82161289 |
12 | 45591981 |
13 | 27112c66 |
14 | 172cc641 |
15 | e045d07 |
hex | 984b131 |
159691057 has 4 divisors (see below), whose sum is σ = 159795700. Its totient is φ = 159586416.
The previous prime is 159691039. The next prime is 159691061. The reversal of 159691057 is 750196951.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 750196951 = 7 ⋅107170993.
It can be written as a sum of positive squares in 2 ways, for example, as 67223601 + 92467456 = 8199^2 + 9616^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-159691057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (159691027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49998 + ... + 53095.
It is an arithmetic number, because the mean of its divisors is an integer number (39948925).
Almost surely, 2159691057 is an apocalyptic number.
It is an amenable number.
159691057 is a deficient number, since it is larger than the sum of its proper divisors (104643).
159691057 is a wasteful number, since it uses less digits than its factorization.
159691057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104642.
The product of its (nonzero) digits is 85050, while the sum is 43.
The square root of 159691057 is about 12636.8926955957. The cubic root of 159691057 is about 542.5338813811.
The spelling of 159691057 in words is "one hundred fifty-nine million, six hundred ninety-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •