Base | Representation |
---|---|
bin | 1001100011100111… |
… | …01101111000100001 |
3 | 111020120010220021111 |
4 | 10301303231320201 |
5 | 41001413430121 |
6 | 2205034423321 |
7 | 241066310200 |
oct | 46163557041 |
9 | 14216126244 |
10 | 5130608161 |
11 | 21a3104938 |
12 | bb2291b41 |
13 | 639c2b123 |
14 | 36957d237 |
15 | 2006552e1 |
hex | 131cede21 |
5130608161 has 6 divisors (see below), whose sum is σ = 5968258530. Its totient is φ = 4397664096.
The previous prime is 5130608141. The next prime is 5130608179. The reversal of 5130608161 is 1618060315.
It can be written as a sum of positive squares in only one way, i.e., 4343469025 + 787139136 = 65905^2 + 28056^2 .
It is not a de Polignac number, because 5130608161 - 27 = 5130608033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5130608141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 52353096 + ... + 52353193.
It is an arithmetic number, because the mean of its divisors is an integer number (994709755).
Almost surely, 25130608161 is an apocalyptic number.
It is an amenable number.
5130608161 is a deficient number, since it is larger than the sum of its proper divisors (837650369).
5130608161 is a wasteful number, since it uses less digits than its factorization.
5130608161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104706303 (or 104706296 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 5130608161 is about 71628.2637022565. The cubic root of 5130608161 is about 1724.7372741093.
Adding to 5130608161 its reverse (1618060315), we get a palindrome (6748668476).
The spelling of 5130608161 in words is "five billion, one hundred thirty million, six hundred eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •