Base | Representation |
---|---|
bin | 1001101001010100… |
… | …11010001111011111 |
3 | 111100220021001121122 |
4 | 10310222122033133 |
5 | 41101144000223 |
6 | 2213505121155 |
7 | 242220344552 |
oct | 46452321737 |
9 | 14326231548 |
10 | 5178500063 |
11 | 2218145820 |
12 | 10063291bb |
13 | 646b28b29 |
14 | 371a88699 |
15 | 2049655c8 |
hex | 134a9a3df |
5178500063 has 8 divisors (see below), whose sum is σ = 5651012736. Its totient is φ = 4706277400.
The previous prime is 5178500021. The next prime is 5178500081. The reversal of 5178500063 is 3600058715.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5178500063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5178499996 and 5178500032.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5178500083) 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, 34283 + ... + 107388.
It is an arithmetic number, because the mean of its divisors is an integer number (706376592).
Almost surely, 25178500063 is an apocalyptic number.
5178500063 is a deficient number, since it is larger than the sum of its proper divisors (472512673).
5178500063 is a wasteful number, since it uses less digits than its factorization.
5178500063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145005.
The product of its (nonzero) digits is 25200, while the sum is 35.
The square root of 5178500063 is about 71961.7958572464. The cubic root of 5178500063 is about 1730.0872090088.
Adding to 5178500063 its reverse (3600058715), we get a palindrome (8778558778).
The spelling of 5178500063 in words is "five billion, one hundred seventy-eight million, five hundred thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •