Base | Representation |
---|---|
bin | 11111010011111100111000… |
… | …01011100000000000001101 |
3 | 100000210111102010120022220111 |
4 | 33221332130023200000031 |
5 | 33011111013142420131 |
6 | 402235354440520021 |
7 | 20334425026364146 |
oct | 1751763413400015 |
9 | 300714363508814 |
10 | 68855240982541 |
11 | 1aa37386533912 |
12 | 7880734a80011 |
13 | 2c56037c23720 |
14 | 130087bb3cacd |
15 | 7e6139858ab1 |
hex | 3e9f9c2e000d |
68855240982541 has 8 divisors (see below), whose sum is σ = 74440326381624. Its totient is φ = 63311373926400.
The previous prime is 68855240982511. The next prime is 68855240982569. The reversal of 68855240982541 is 14528904255886.
It can be written as a sum of positive squares in 4 ways, for example, as 9891716912100 + 58963524070441 = 3145110^2 + 7678771^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 68855240982541 - 27 = 68855240982413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68855240982511) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10304582260 + ... + 10304588941.
It is an arithmetic number, because the mean of its divisors is an integer number (9305040797703).
Almost surely, 268855240982541 is an apocalyptic number.
It is an amenable number.
68855240982541 is a deficient number, since it is larger than the sum of its proper divisors (5585085399083).
68855240982541 is a wasteful number, since it uses less digits than its factorization.
68855240982541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20609171471.
The product of its (nonzero) digits is 221184000, while the sum is 67.
The spelling of 68855240982541 in words is "sixty-eight trillion, eight hundred fifty-five billion, two hundred forty million, nine hundred eighty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •