Base | Representation |
---|---|
bin | 100100000110000100001… |
… | …0000011001110100011101 |
3 | 122120020202110211202122121 |
4 | 1020030020100121310131 |
5 | 1122234232342312134 |
6 | 14314545532142541 |
7 | 1021256613041164 |
oct | 110141020316435 |
9 | 18506673752577 |
10 | 4960825744669 |
11 | 1642968893733 |
12 | 681536607a51 |
13 | 29ca5b109a22 |
14 | 132168b263db |
15 | 89098499ab4 |
hex | 48308419d1d |
4960825744669 has 2 divisors, whose sum is σ = 4960825744670. Its totient is φ = 4960825744668.
The previous prime is 4960825744643. The next prime is 4960825744687. The reversal of 4960825744669 is 9664475280694.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4916694239044 + 44131505625 = 2217362^2 + 210075^2 .
It is a cyclic number.
It is not a de Polignac number, because 4960825744669 - 27 = 4960825744541 is a prime.
It is a super-2 number, since 2×49608257446692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4960825744598 and 4960825744607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4960825744969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2480412872334 + 2480412872335.
It is an arithmetic number, because the mean of its divisors is an integer number (2480412872335).
Almost surely, 24960825744669 is an apocalyptic number.
It is an amenable number.
4960825744669 is a deficient number, since it is larger than the sum of its proper divisors (1).
4960825744669 is an equidigital number, since it uses as much as digits as its factorization.
4960825744669 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 627056640, while the sum is 70.
The spelling of 4960825744669 in words is "four trillion, nine hundred sixty billion, eight hundred twenty-five million, seven hundred forty-four thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •