Base | Representation |
---|---|
bin | 1001101000100000… |
… | …01000000111000011 |
3 | 111100102022000022000 |
4 | 10310100020013003 |
5 | 41042413010201 |
6 | 2213101315043 |
7 | 242104650216 |
oct | 46420100703 |
9 | 14312260260 |
10 | 5171610051 |
11 | 221426a1a3 |
12 | 1003b65a83 |
13 | 6455859ba |
14 | 370bb377d |
15 | 204053d86 |
hex | 1344081c3 |
5171610051 has 16 divisors (see below), whose sum is σ = 7701349920. Its totient is φ = 3429872640.
The previous prime is 5171609977. The next prime is 5171610077. The reversal of 5171610051 is 1500161715.
It is a happy number.
It is not a de Polignac number, because 5171610051 - 27 = 5171609923 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5171609997 and 5171610024.
It is not an unprimeable number, because it can be changed into a prime (5171610091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 491010 + ... + 501431.
It is an arithmetic number, because the mean of its divisors is an integer number (481334370).
Almost surely, 25171610051 is an apocalyptic number.
5171610051 is a deficient number, since it is larger than the sum of its proper divisors (2529739869).
5171610051 is a wasteful number, since it uses less digits than its factorization.
5171610051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992643 (or 992637 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 27.
The square root of 5171610051 is about 71913.9072155032. The cubic root of 5171610051 is about 1729.3195728160.
Adding to 5171610051 its reverse (1500161715), we get a palindrome (6671771766).
The spelling of 5171610051 in words is "five billion, one hundred seventy-one million, six hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •