Base | Representation |
---|---|
bin | 1010010000111001… |
… | …11000111011010011 |
3 | 112020000222101222111 |
4 | 11020130320323103 |
5 | 42241142000201 |
6 | 2310445050151 |
7 | 253361322550 |
oct | 51034707323 |
9 | 15200871874 |
10 | 5510500051 |
11 | 2378596281 |
12 | 1099556957 |
13 | 69a84c024 |
14 | 3a3bcba27 |
15 | 223b95b51 |
hex | 148738ed3 |
5510500051 has 8 divisors (see below), whose sum is σ = 6325217120. Its totient is φ = 4702658688.
The previous prime is 5510500049. The next prime is 5510500109. The reversal of 5510500051 is 1500050155.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5510500051 - 21 = 5510500049 is a prime.
It is a super-2 number, since 2×55105000512 = 60731221624142005202, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5510499995 and 5510500031.
It is not an unprimeable number, because it can be changed into a prime (5510506051) 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 7 ways as a sum of consecutive naturals, for example, 1717206 + ... + 1720411.
It is an arithmetic number, because the mean of its divisors is an integer number (790652140).
Almost surely, 25510500051 is an apocalyptic number.
5510500051 is a deficient number, since it is larger than the sum of its proper divisors (814717069).
5510500051 is a wasteful number, since it uses less digits than its factorization.
5510500051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3437853.
The product of its (nonzero) digits is 625, while the sum is 22.
The square root of 5510500051 is about 74232.7424456351. The cubic root of 5510500051 is about 1766.2967516988.
The spelling of 5510500051 in words is "five billion, five hundred ten million, five hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •