Base | Representation |
---|---|
bin | 101011110110000101100… |
… | …0011001111001000000001 |
3 | 210100002020000020211202221 |
4 | 1113230023003033020001 |
5 | 1242212244233422144 |
6 | 20452152322411041 |
7 | 1161236335143031 |
oct | 127541303171001 |
9 | 23302200224687 |
10 | 6026024514049 |
11 | 1a13693816001 |
12 | 813a73500a81 |
13 | 349336c07437 |
14 | 16b9382658c1 |
15 | a6b3da7ed84 |
hex | 57b0b0cf201 |
6026024514049 has 2 divisors, whose sum is σ = 6026024514050. Its totient is φ = 6026024514048.
The previous prime is 6026024514047. The next prime is 6026024514173. The reversal of 6026024514049 is 9404154206206.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4307285160000 + 1718739354049 = 2075400^2 + 1311007^2 .
It is a cyclic number.
It is not a de Polignac number, because 6026024514049 - 21 = 6026024514047 is a prime.
Together with 6026024514047, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 6026024513996 and 6026024514014.
It is not a weakly prime, because it can be changed into another prime (6026024514047) 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, 3013012257024 + 3013012257025.
It is an arithmetic number, because the mean of its divisors is an integer number (3013012257025).
Almost surely, 26026024514049 is an apocalyptic number.
It is an amenable number.
6026024514049 is a deficient number, since it is larger than the sum of its proper divisors (1).
6026024514049 is an equidigital number, since it uses as much as digits as its factorization.
6026024514049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 43.
The spelling of 6026024514049 in words is "six trillion, twenty-six billion, twenty-four million, five hundred fourteen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •