Base | Representation |
---|---|
bin | 1001100011100100… |
… | …01001010000111011 |
3 | 111020112100221221021 |
4 | 10301302021100323 |
5 | 41001312233102 |
6 | 2205021523311 |
7 | 241062642505 |
oct | 46162112073 |
9 | 14215327837 |
10 | 5130196027 |
11 | 21a2953230 |
12 | bb2113537 |
13 | 639b15668 |
14 | 3694b2d75 |
15 | 2005c3137 |
hex | 131c8943b |
5130196027 has 8 divisors (see below), whose sum is σ = 5627845440. Its totient is φ = 4637757960.
The previous prime is 5130195997. The next prime is 5130196033. The reversal of 5130196027 is 7206910315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5130196027 - 211 = 5130193979 is a prime.
It is a super-2 number, since 2×51301960272 = 52637822550893169458, 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 = 5130195983 and 5130196001.
It is not an unprimeable number, because it can be changed into a prime (5130196037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1300773 + ... + 1304710.
It is an arithmetic number, because the mean of its divisors is an integer number (703480680).
Almost surely, 25130196027 is an apocalyptic number.
5130196027 is a deficient number, since it is larger than the sum of its proper divisors (497649413).
5130196027 is a wasteful number, since it uses less digits than its factorization.
5130196027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2605673.
The product of its (nonzero) digits is 11340, while the sum is 34.
The square root of 5130196027 is about 71625.3867493921. The cubic root of 5130196027 is about 1724.6910910264.
The spelling of 5130196027 in words is "five billion, one hundred thirty million, one hundred ninety-six thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •