Base | Representation |
---|---|
bin | 1001101110010010… |
… | …01110111010010111 |
3 | 111110210121022101201 |
4 | 10313021032322113 |
5 | 41142323301201 |
6 | 2221553333331 |
7 | 243234261112 |
oct | 46711167227 |
9 | 14423538351 |
10 | 5220134551 |
11 | 22396a2395 |
12 | 1018267247 |
13 | 652645618 |
14 | 377405579 |
15 | 20843b801 |
hex | 13724ee97 |
5220134551 has 4 divisors (see below), whose sum is σ = 5220280512. Its totient is φ = 5219988592.
The previous prime is 5220134489. The next prime is 5220134567. The reversal of 5220134551 is 1554310225.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5220134551 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5220134251) 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 3 ways as a sum of consecutive naturals, for example, 21051 + ... + 104323.
It is an arithmetic number, because the mean of its divisors is an integer number (1305070128).
Almost surely, 25220134551 is an apocalyptic number.
5220134551 is a deficient number, since it is larger than the sum of its proper divisors (145961).
5220134551 is an equidigital number, since it uses as much as digits as its factorization.
5220134551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145960.
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 5220134551 is about 72250.4986211168. The cubic root of 5220134551 is about 1734.7113994799.
Adding to 5220134551 its reverse (1554310225), we get a palindrome (6774444776).
The spelling of 5220134551 in words is "five billion, two hundred twenty million, one hundred thirty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •