Base | Representation |
---|---|
bin | 101100000001011110000… |
… | …001100011110100010101 |
3 | 101201012122210022211100011 |
4 | 230001132001203310111 |
5 | 344031140004143131 |
6 | 10233435025120221 |
7 | 431365062326242 |
oct | 54013601436425 |
9 | 11635583284304 |
10 | 3025234443541 |
11 | a66aa3a806a2 |
12 | 40a388a89071 |
13 | 18c3807c00bb |
14 | a65ca46a5c9 |
15 | 53a5ecc60b1 |
hex | 2c05e063d15 |
3025234443541 has 2 divisors, whose sum is σ = 3025234443542. Its totient is φ = 3025234443540.
The previous prime is 3025234443529. The next prime is 3025234443547. The reversal of 3025234443541 is 1453444325203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2722321802916 + 302912640625 = 1649946^2 + 550375^2 .
It is a cyclic number.
It is not a de Polignac number, because 3025234443541 - 25 = 3025234443509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3025234443494 and 3025234443503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3025234443547) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1512617221770 + 1512617221771.
It is an arithmetic number, because the mean of its divisors is an integer number (1512617221771).
Almost surely, 23025234443541 is an apocalyptic number.
It is an amenable number.
3025234443541 is a deficient number, since it is larger than the sum of its proper divisors (1).
3025234443541 is an equidigital number, since it uses as much as digits as its factorization.
3025234443541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 691200, while the sum is 40.
Adding to 3025234443541 its reverse (1453444325203), we get a palindrome (4478678768744).
The spelling of 3025234443541 in words is "three trillion, twenty-five billion, two hundred thirty-four million, four hundred forty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •