Base | Representation |
---|---|
bin | 1001010111101011… |
… | …10110000110101011 |
3 | 110222120210000120112 |
4 | 10223311312012223 |
5 | 40300302042302 |
6 | 2151101044535 |
7 | 235442366000 |
oct | 45365660653 |
9 | 13876700515 |
10 | 5030502827 |
11 | 2151651259 |
12 | b8485674b |
13 | 62227b6bc |
14 | 35a1618a7 |
15 | 1e697e552 |
hex | 12bd761ab |
5030502827 has 32 divisors (see below), whose sum is σ = 6224947200. Its totient is φ = 4049485440.
The previous prime is 5030502787. The next prime is 5030502847. The reversal of 5030502827 is 7282050305.
5030502827 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5030502827 - 28 = 5030502571 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5030502793 and 5030502802.
It is not an unprimeable number, because it can be changed into a prime (5030502847) 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 31 ways as a sum of consecutive naturals, for example, 5311568 + ... + 5312514.
It is an arithmetic number, because the mean of its divisors is an integer number (194529600).
Almost surely, 25030502827 is an apocalyptic number.
5030502827 is a deficient number, since it is larger than the sum of its proper divisors (1194444373).
5030502827 is an equidigital number, since it uses as much as digits as its factorization.
5030502827 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1896 (or 1882 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 32.
The square root of 5030502827 is about 70926.0377224049. The cubic root of 5030502827 is about 1713.4461727989.
The spelling of 5030502827 in words is "five billion, thirty million, five hundred two thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •