Base | Representation |
---|---|
bin | 1000001010111… |
… | …10001011000001 |
3 | 11202222100112220 |
4 | 10011132023001 |
5 | 120021340134 |
6 | 10445041253 |
7 | 1461415212 |
oct | 405361301 |
9 | 152870486 |
10 | 68543169 |
11 | 35766552 |
12 | 1ab56229 |
13 | 1127b6b6 |
14 | 9163409 |
15 | 603e149 |
hex | 415e2c1 |
68543169 has 4 divisors (see below), whose sum is σ = 91390896. Its totient is φ = 45695444.
The previous prime is 68543141. The next prime is 68543177. The reversal of 68543169 is 96134586.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-68543169 is a prime.
It is a super-2 number, since 2×685431692 = 9396332033125122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 68543169.
It is not an unprimeable number, because it can be changed into a prime (68543179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11423859 + ... + 11423864.
It is an arithmetic number, because the mean of its divisors is an integer number (22847724).
Almost surely, 268543169 is an apocalyptic number.
It is an amenable number.
68543169 is a deficient number, since it is larger than the sum of its proper divisors (22847727).
68543169 is a wasteful number, since it uses less digits than its factorization.
68543169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22847726.
The product of its digits is 155520, while the sum is 42.
The square root of 68543169 is about 8279.0802025346. The cubic root of 68543169 is about 409.2494080016.
The spelling of 68543169 in words is "sixty-eight million, five hundred forty-three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •