Base | Representation |
---|---|
bin | 1001101001000000… |
… | …00111000011110011 |
3 | 111100201011212220012 |
4 | 10310200013003303 |
5 | 41100001100201 |
6 | 2213331205135 |
7 | 242155401032 |
oct | 46440070363 |
9 | 14321155805 |
10 | 5175800051 |
11 | 2216671204 |
12 | 10054467ab |
13 | 6463c1ba6 |
14 | 371584719 |
15 | 2045d05bb |
hex | 1348070f3 |
5175800051 has 4 divisors (see below), whose sum is σ = 5448210600. Its totient is φ = 4903389504.
The previous prime is 5175800033. The next prime is 5175800057. The reversal of 5175800051 is 1500085715.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1500085715 = 5 ⋅300017143.
It is a cyclic number.
It is not a de Polignac number, because 5175800051 - 214 = 5175783667 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5175799990 and 5175800017.
It is not an unprimeable number, because it can be changed into a prime (5175800057) 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, 136205246 + ... + 136205283.
It is an arithmetic number, because the mean of its divisors is an integer number (1362052650).
Almost surely, 25175800051 is an apocalyptic number.
5175800051 is a deficient number, since it is larger than the sum of its proper divisors (272410549).
5175800051 is a wasteful number, since it uses less digits than its factorization.
5175800051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272410548.
The product of its (nonzero) digits is 7000, while the sum is 32.
The square root of 5175800051 is about 71943.0333736353. The cubic root of 5175800051 is about 1729.7864740308.
Adding to 5175800051 its reverse (1500085715), we get a palindrome (6675885766).
The spelling of 5175800051 in words is "five billion, one hundred seventy-five million, eight hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •