Base | Representation |
---|---|
bin | 100010111110000011111… |
… | …1010010010100110001101 |
3 | 122000110122102100020120202 |
4 | 1011330013322102212031 |
5 | 1112221044442002021 |
6 | 14115534402023245 |
7 | 1004144100335414 |
oct | 105740772224615 |
9 | 18013572306522 |
10 | 4806201125261 |
11 | 1593331268578 |
12 | 657583047b25 |
13 | 28b2b87003a3 |
14 | 12889b0aa47b |
15 | 850488b2a0b |
hex | 45f07e9298d |
4806201125261 has 2 divisors, whose sum is σ = 4806201125262. Its totient is φ = 4806201125260.
The previous prime is 4806201125197. The next prime is 4806201125269. The reversal of 4806201125261 is 1625211026084.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3526485875236 + 1279715250025 = 1877894^2 + 1131245^2 .
It is a cyclic number.
It is not a de Polignac number, because 4806201125261 - 26 = 4806201125197 is a prime.
It is a super-3 number, since 3×48062011252613 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 (4806201125269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2403100562630 + 2403100562631.
It is an arithmetic number, because the mean of its divisors is an integer number (2403100562631).
Almost surely, 24806201125261 is an apocalyptic number.
It is an amenable number.
4806201125261 is a deficient number, since it is larger than the sum of its proper divisors (1).
4806201125261 is an equidigital number, since it uses as much as digits as its factorization.
4806201125261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46080, while the sum is 38.
The spelling of 4806201125261 in words is "four trillion, eight hundred six billion, two hundred one million, one hundred twenty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •