Base | Representation |
---|---|
bin | 1011001110001111… |
… | …01101000011000101 |
3 | 120112220011202012012 |
4 | 11213013231003011 |
5 | 44314402240234 |
6 | 2433505304005 |
7 | 302206665326 |
oct | 54707550305 |
9 | 16486152165 |
10 | 6025040069 |
11 | 2611a83864 |
12 | 1201935005 |
13 | 750325289 |
14 | 41228a44d |
15 | 253e320ce |
hex | 1671ed0c5 |
6025040069 has 2 divisors, whose sum is σ = 6025040070. Its totient is φ = 6025040068.
The previous prime is 6025040041. The next prime is 6025040071. The reversal of 6025040069 is 9600405206.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4057053025 + 1967987044 = 63695^2 + 44362^2 .
It is a cyclic number.
It is not a de Polignac number, because 6025040069 - 224 = 6008262853 is a prime.
It is a super-2 number, since 2×60250400692 = 72602215666111049522, which contains 22 as substring.
Together with 6025040071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6025040269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3012520034 + 3012520035.
It is an arithmetic number, because the mean of its divisors is an integer number (3012520035).
Almost surely, 26025040069 is an apocalyptic number.
It is an amenable number.
6025040069 is a deficient number, since it is larger than the sum of its proper divisors (1).
6025040069 is an equidigital number, since it uses as much as digits as its factorization.
6025040069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 6025040069 is about 77621.1315879896. The cubic root of 6025040069 is about 1819.6449080819.
The spelling of 6025040069 in words is "six billion, twenty-five million, forty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •