Base | Representation |
---|---|
bin | 1001011011101001… |
… | …00001110110000011 |
3 | 111001220021020011202 |
4 | 10231310201312003 |
5 | 40332302242011 |
6 | 2154244531415 |
7 | 236324562062 |
oct | 45564416603 |
9 | 14056236152 |
10 | 5063712131 |
11 | 2169373965 |
12 | b939b0b6b |
13 | 62910838a |
14 | 3607281d9 |
15 | 1e983e23b |
hex | 12dd21d83 |
5063712131 has 8 divisors (see below), whose sum is σ = 5362738944. Its totient is φ = 4771257480.
The previous prime is 5063712103. The next prime is 5063712139. The reversal of 5063712131 is 1312173605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5063712131 is a prime.
It is a super-2 number, since 2×50637121312 = 51282361091273122322, 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 = 5063712094 and 5063712103.
It is not an unprimeable number, because it can be changed into a prime (5063712139) 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, 1641455 + ... + 1644536.
It is an arithmetic number, because the mean of its divisors is an integer number (670342368).
Almost surely, 25063712131 is an apocalyptic number.
5063712131 is a deficient number, since it is larger than the sum of its proper divisors (299026813).
5063712131 is a wasteful number, since it uses less digits than its factorization.
5063712131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3286081.
The product of its (nonzero) digits is 3780, while the sum is 29.
The square root of 5063712131 is about 71159.7648323826. The cubic root of 5063712131 is about 1717.2083942392.
Adding to 5063712131 its reverse (1312173605), we get a palindrome (6375885736).
The spelling of 5063712131 in words is "five billion, sixty-three million, seven hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •