Base | Representation |
---|---|
bin | 11110111110010001101000… |
… | …11000000011010010101001 |
3 | 22221011022000202202110100210 |
4 | 33133020310120003102221 |
5 | 32411410220321201022 |
6 | 400505303520051333 |
7 | 20226550641341523 |
oct | 1737106430032251 |
9 | 287138022673323 |
10 | 68110470100137 |
11 | 1a77a54080a663 |
12 | 7780322763b49 |
13 | 2c00a361860ba |
14 | 12b67c87aaa13 |
15 | 7d1a9a01ea0c |
hex | 3df2346034a9 |
68110470100137 has 8 divisors (see below), whose sum is σ = 90825189788736. Its totient is φ = 45401365239152.
The previous prime is 68110470100117. The next prime is 68110470100171. The reversal of 68110470100137 is 73100107401186.
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 68110470100137 - 211 = 68110470098089 is a prime.
It is a super-2 number, since 2×681104701001372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 68110470100095 and 68110470100104.
It is not an unprimeable number, because it can be changed into a prime (68110470100117) 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, 1403678598 + ... + 1403727119.
It is an arithmetic number, because the mean of its divisors is an integer number (11353148723592).
Almost surely, 268110470100137 is an apocalyptic number.
It is an amenable number.
68110470100137 is a deficient number, since it is larger than the sum of its proper divisors (22714719688599).
68110470100137 is a wasteful number, since it uses less digits than its factorization.
68110470100137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2807413807.
The product of its (nonzero) digits is 28224, while the sum is 39.
The spelling of 68110470100137 in words is "sixty-eight trillion, one hundred ten billion, four hundred seventy million, one hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •