Base | Representation |
---|---|
bin | 1001101010110000… |
… | …11100110011000111 |
3 | 111101201222020022012 |
4 | 10311120130303013 |
5 | 41112241203114 |
6 | 2215015524435 |
7 | 242425052456 |
oct | 46530346307 |
9 | 14351866265 |
10 | 5190569159 |
11 | 2223a39486 |
12 | 100a38971b |
13 | 6494933c9 |
14 | 37350ab9d |
15 | 205a4b63e |
hex | 13561ccc7 |
5190569159 has 4 divisors (see below), whose sum is σ = 5205442200. Its totient is φ = 5175696120.
The previous prime is 5190569141. The next prime is 5190569177. The reversal of 5190569159 is 9519650915.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (5190569141) and next prime (5190569177).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5190569159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5190569179) 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 3 ways as a sum of consecutive naturals, for example, 7435997 + ... + 7436694.
It is an arithmetic number, because the mean of its divisors is an integer number (1301360550).
Almost surely, 25190569159 is an apocalyptic number.
5190569159 is a deficient number, since it is larger than the sum of its proper divisors (14873041).
5190569159 is a wasteful number, since it uses less digits than its factorization.
5190569159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14873040.
The product of its (nonzero) digits is 546750, while the sum is 50.
The square root of 5190569159 is about 72045.6047167348. The cubic root of 5190569159 is about 1731.4302226089.
The spelling of 5190569159 in words is "five billion, one hundred ninety million, five hundred sixty-nine thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •