Base | Representation |
---|---|
bin | 1001101010110110… |
… | …00101101101011011 |
3 | 111101210021101100122 |
4 | 10311123011231123 |
5 | 41112430323034 |
6 | 2215042423455 |
7 | 242433663530 |
oct | 46533055533 |
9 | 14353241318 |
10 | 5191261019 |
11 | 222437126a |
12 | 100a661b8b |
13 | 6496762a9 |
14 | 37364ad87 |
15 | 205b3662e |
hex | 1356c5b5b |
5191261019 has 8 divisors (see below), whose sum is σ = 5985373920. Its totient is φ = 4410274176.
The previous prime is 5191260973. The next prime is 5191261021. The reversal of 5191261019 is 9101621915.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5191261019 - 212 = 5191256923 is a prime.
It is a super-2 number, since 2×51912610192 = 53898381934777836722, which contains 22 as substring.
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 5191261019.
It is not an unprimeable number, because it can be changed into a prime (5191261099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3280664 + ... + 3282245.
It is an arithmetic number, because the mean of its divisors is an integer number (748171740).
Almost surely, 25191261019 is an apocalyptic number.
5191261019 is a deficient number, since it is larger than the sum of its proper divisors (794112901).
5191261019 is a wasteful number, since it uses less digits than its factorization.
5191261019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6563029.
The product of its (nonzero) digits is 4860, while the sum is 35.
The square root of 5191261019 is about 72050.4060987861. The cubic root of 5191261019 is about 1731.5071476408.
The spelling of 5191261019 in words is "five billion, one hundred ninety-one million, two hundred sixty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •