Base | Representation |
---|---|
bin | 1001110101011111… |
… | …01100110010100011 |
3 | 111122000021201212211 |
4 | 10322233230302203 |
5 | 41303310100201 |
6 | 2231552302551 |
7 | 244566635440 |
oct | 47257546243 |
9 | 14560251784 |
10 | 5280550051 |
11 | 226a807457 |
12 | 1034541a57 |
13 | 66200973a |
14 | 3814509c7 |
15 | 20d8c2651 |
hex | 13abecca3 |
5280550051 has 4 divisors (see below), whose sum is σ = 6034914352. Its totient is φ = 4526185752.
The previous prime is 5280550039. The next prime is 5280550087. The reversal of 5280550051 is 1500550825.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5280550051 - 25 = 5280550019 is a prime.
It is a super-2 number, since 2×52805500512 = 55768417682232205202, 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 = 5280549995 and 5280550022.
It is not an unprimeable number, because it can be changed into a prime (5280550001) 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, 377182140 + ... + 377182153.
It is an arithmetic number, because the mean of its divisors is an integer number (1508728588).
Almost surely, 25280550051 is an apocalyptic number.
5280550051 is a deficient number, since it is larger than the sum of its proper divisors (754364301).
5280550051 is an equidigital number, since it uses as much as digits as its factorization.
5280550051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754364300.
The product of its (nonzero) digits is 10000, while the sum is 31.
The square root of 5280550051 is about 72667.3933136452. The cubic root of 5280550051 is about 1741.3780041561.
The spelling of 5280550051 in words is "five billion, two hundred eighty million, five hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •