Base | Representation |
---|---|
bin | 111111110100000100… |
… | …001010101101110001 |
3 | 20112212020001011121021 |
4 | 333310010022231301 |
5 | 2110311411230414 |
6 | 51251033055441 |
7 | 4643653644466 |
oct | 776404125561 |
9 | 215766034537 |
10 | 68519242609 |
11 | 27071365134 |
12 | 11342b57581 |
13 | 65cc731b4c |
14 | 34600c166d |
15 | 1bb0617c24 |
hex | ff410ab71 |
68519242609 has 4 divisors (see below), whose sum is σ = 69019383204. Its totient is φ = 68019102016.
The previous prime is 68519242607. The next prime is 68519242633. The reversal of 68519242609 is 90624291586.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44987682609 + 23531560000 = 212103^2 + 153400^2 .
It is a cyclic number.
It is not a de Polignac number, because 68519242609 - 21 = 68519242607 is a prime.
It is a super-2 number, since 2×685192426092 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (68519242607) 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 in 3 ways as a sum of consecutive naturals, for example, 250070092 + ... + 250070365.
It is an arithmetic number, because the mean of its divisors is an integer number (17254845801).
Almost surely, 268519242609 is an apocalyptic number.
It is an amenable number.
68519242609 is a deficient number, since it is larger than the sum of its proper divisors (500140595).
68519242609 is a wasteful number, since it uses less digits than its factorization.
68519242609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500140594.
The product of its (nonzero) digits is 1866240, while the sum is 52.
The spelling of 68519242609 in words is "sixty-eight billion, five hundred nineteen million, two hundred forty-two thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •