Base | Representation |
---|---|
bin | 1001100111101110… |
… | …11111011110000011 |
3 | 111022222010220200210 |
4 | 10303313133132003 |
5 | 41034234332011 |
6 | 2212311045203 |
7 | 241666032366 |
oct | 46367373603 |
9 | 14288126623 |
10 | 5165152131 |
11 | 2210659277 |
12 | 1001970803 |
13 | 644134449 |
14 | 36ddb20dd |
15 | 2036ca6a6 |
hex | 133ddf783 |
5165152131 has 8 divisors (see below), whose sum is σ = 7047029440. Its totient is φ = 3363354792.
The previous prime is 5165152129. The next prime is 5165152133. The reversal of 5165152131 is 1312515615.
It is an interprime number because it is at equal distance from previous prime (5165152129) and next prime (5165152133).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5165152131 - 21 = 5165152129 is a prime.
It is a super-2 number, since 2×51651521312 = 53357593072747682322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5165152133) 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, 20019841 + ... + 20020098.
It is an arithmetic number, because the mean of its divisors is an integer number (880878680).
Almost surely, 25165152131 is an apocalyptic number.
5165152131 is a deficient number, since it is larger than the sum of its proper divisors (1881877309).
5165152131 is a wasteful number, since it uses less digits than its factorization.
5165152131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40039985.
The product of its digits is 4500, while the sum is 30.
The square root of 5165152131 is about 71868.9928341841. The cubic root of 5165152131 is about 1728.5994579916.
Adding to 5165152131 its reverse (1312515615), we get a palindrome (6477667746).
The spelling of 5165152131 in words is "five billion, one hundred sixty-five million, one hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •