Base | Representation |
---|---|
bin | 1001001011001100… |
… | …10100001001000101 |
3 | 110201021200221202112 |
4 | 10211212110021011 |
5 | 40041444041021 |
6 | 2132440150405 |
7 | 233031224261 |
oct | 44546241105 |
9 | 13637627675 |
10 | 4925768261 |
11 | 20a8516667 |
12 | b55768405 |
13 | 60666ab9b |
14 | 34a29b0a1 |
15 | 1dc691d5b |
hex | 125994245 |
4925768261 has 2 divisors, whose sum is σ = 4925768262. Its totient is φ = 4925768260.
The previous prime is 4925768257. The next prime is 4925768299. The reversal of 4925768261 is 1628675294.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2738428900 + 2187339361 = 52330^2 + 46769^2 .
It is a cyclic number.
It is not a de Polignac number, because 4925768261 - 22 = 4925768257 is a prime.
It is a super-2 number, since 2×49257682612 = 48526385922149928242, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4925768761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2462884130 + 2462884131.
It is an arithmetic number, because the mean of its divisors is an integer number (2462884131).
Almost surely, 24925768261 is an apocalyptic number.
It is an amenable number.
4925768261 is a deficient number, since it is larger than the sum of its proper divisors (1).
4925768261 is an equidigital number, since it uses as much as digits as its factorization.
4925768261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1451520, while the sum is 50.
The square root of 4925768261 is about 70183.8176576339. The cubic root of 4925768261 is about 1701.4714205207.
The spelling of 4925768261 in words is "four billion, nine hundred twenty-five million, seven hundred sixty-eight thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •