Base | Representation |
---|---|
bin | 1001100101101110… |
… | …01110111010110001 |
3 | 111021210110002200112 |
4 | 10302313032322301 |
5 | 41020431311441 |
6 | 2210510031105 |
7 | 241402613516 |
oct | 46267167261 |
9 | 14253402615 |
10 | 5148307121 |
11 | 22020a3381 |
12 | bb81a8495 |
13 | 6407b7099 |
14 | 36ba6930d |
15 | 201e9e4eb |
hex | 132dceeb1 |
5148307121 has 2 divisors, whose sum is σ = 5148307122. Its totient is φ = 5148307120.
The previous prime is 5148307091. The next prime is 5148307133. The reversal of 5148307121 is 1217038415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5111535025 + 36772096 = 71495^2 + 6064^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5148307121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5148307141) 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 as a sum of consecutive naturals, namely, 2574153560 + 2574153561.
It is an arithmetic number, because the mean of its divisors is an integer number (2574153561).
Almost surely, 25148307121 is an apocalyptic number.
It is an amenable number.
5148307121 is a deficient number, since it is larger than the sum of its proper divisors (1).
5148307121 is an equidigital number, since it uses as much as digits as its factorization.
5148307121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720, while the sum is 32.
The square root of 5148307121 is about 71751.7046557084. The cubic root of 5148307121 is about 1726.7182622281.
The spelling of 5148307121 in words is "five billion, one hundred forty-eight million, three hundred seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •