Base | Representation |
---|---|
bin | 1001100011001101… |
… | …10100011011111011 |
3 | 111020022210010101011 |
4 | 10301212310123323 |
5 | 41000032232011 |
6 | 2204434134351 |
7 | 241025466025 |
oct | 46146643373 |
9 | 14208703334 |
10 | 5127227131 |
11 | 21a12056a4 |
12 | bb11213b7 |
13 | 639316210 |
14 | 368d3d015 |
15 | 2001d8621 |
hex | 1319b46fb |
5127227131 has 4 divisors (see below), whose sum is σ = 5521629232. Its totient is φ = 4732825032.
The previous prime is 5127227117. The next prime is 5127227179. The reversal of 5127227131 is 1317227215.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5127227131 - 27 = 5127227003 is a prime.
It is a super-2 number, since 2×51272271312 = 52576916105724982322, 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 = 5127227093 and 5127227102.
It is not an unprimeable number, because it can be changed into a prime (5127227191) 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, 197201031 + ... + 197201056.
It is an arithmetic number, because the mean of its divisors is an integer number (1380407308).
Almost surely, 25127227131 is an apocalyptic number.
5127227131 is a deficient number, since it is larger than the sum of its proper divisors (394402101).
5127227131 is a wasteful number, since it uses less digits than its factorization.
5127227131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394402100.
The product of its digits is 5880, while the sum is 31.
The square root of 5127227131 is about 71604.6585844804. The cubic root of 5127227131 is about 1724.3583281378.
The spelling of 5127227131 in words is "five billion, one hundred twenty-seven million, two hundred twenty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •