Base | Representation |
---|---|
bin | 111111110101100010… |
… | …010101010100001011 |
3 | 20112220221111021222211 |
4 | 333311202111110023 |
5 | 2110334221140223 |
6 | 51253314125551 |
7 | 4644403525336 |
oct | 776542252413 |
9 | 215827437884 |
10 | 68543927563 |
11 | 27084295321 |
12 | 1134b2808b7 |
13 | 6604895827 |
14 | 34634a961d |
15 | 1bb2891d0d |
hex | ff589550b |
68543927563 has 4 divisors (see below), whose sum is σ = 72575923320. Its totient is φ = 64511931808.
The previous prime is 68543927537. The next prime is 68543927689. The reversal of 68543927563 is 36572934586.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-68543927563 is a prime.
It is a super-2 number, since 2×685439275632 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 68543927498 and 68543927507.
It is not an unprimeable number, because it can be changed into a prime (68543927533) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2015997853 + ... + 2015997886.
It is an arithmetic number, because the mean of its divisors is an integer number (18143980830).
Almost surely, 268543927563 is an apocalyptic number.
68543927563 is a deficient number, since it is larger than the sum of its proper divisors (4031995757).
68543927563 is a wasteful number, since it uses less digits than its factorization.
68543927563 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4031995756.
The product of its digits is 32659200, while the sum is 58.
The spelling of 68543927563 in words is "sixty-eight billion, five hundred forty-three million, nine hundred twenty-seven thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •