Base | Representation |
---|---|
bin | 1011001010011100… |
… | …11110010001111111 |
3 | 120110200101011100111 |
4 | 11211032132101333 |
5 | 44233233311114 |
6 | 2430412210451 |
7 | 301342604455 |
oct | 54516362177 |
9 | 16420334314 |
10 | 5993260159 |
11 | 25a6048077 |
12 | 11b3169a27 |
13 | 7468790b3 |
14 | 40bd769d5 |
15 | 251255bc4 |
hex | 16539e47f |
5993260159 has 4 divisors (see below), whose sum is σ = 5993429904. Its totient is φ = 5993090416.
The previous prime is 5993260127. The next prime is 5993260171. The reversal of 5993260159 is 9510623995.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9510623995 = 5 ⋅1902124799.
It is a cyclic number.
It is not a de Polignac number, because 5993260159 - 25 = 5993260127 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5993260199) 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, 9742 + ... + 109915.
It is an arithmetic number, because the mean of its divisors is an integer number (1498357476).
Almost surely, 25993260159 is an apocalyptic number.
5993260159 is a deficient number, since it is larger than the sum of its proper divisors (169745).
5993260159 is a wasteful number, since it uses less digits than its factorization.
5993260159 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169744.
The product of its (nonzero) digits is 656100, while the sum is 49.
The square root of 5993260159 is about 77416.1492131971. The cubic root of 5993260159 is about 1816.4399432494.
The spelling of 5993260159 in words is "five billion, nine hundred ninety-three million, two hundred sixty thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •