Base | Representation |
---|---|
bin | 1000001100100… |
… | …10011100001111 |
3 | 11210101020020022 |
4 | 10012102130033 |
5 | 120100213023 |
6 | 10453412355 |
7 | 1463266331 |
oct | 406223417 |
9 | 153336208 |
10 | 68757263 |
11 | 358a2393 |
12 | 1b03a0bb |
13 | 11324c93 |
14 | 91bb451 |
15 | 60827c8 |
hex | 419270f |
68757263 has 4 divisors (see below), whose sum is σ = 68773848. Its totient is φ = 68740680.
The previous prime is 68757259. The next prime is 68757277. The reversal of 68757263 is 36275786.
It is a Cunningham number, because it is equal to 82922-1.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 36275786 = 2 ⋅18137893.
It is a cyclic number.
It is not a de Polignac number, because 68757263 - 22 = 68757259 is a prime.
It is a super-2 number, since 2×687572632 = 9455122430502338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68757763) 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, 4145 + ... + 12437.
It is an arithmetic number, because the mean of its divisors is an integer number (17193462).
Almost surely, 268757263 is an apocalyptic number.
68757263 is a deficient number, since it is larger than the sum of its proper divisors (16585).
68757263 is an equidigital number, since it uses as much as digits as its factorization.
68757263 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16584.
The product of its digits is 423360, while the sum is 44.
The square root of 68757263 is about 8291.9999397009. Note that the first 4 decimals coincide. The cubic root of 68757263 is about 409.6750608054.
The spelling of 68757263 in words is "sixty-eight million, seven hundred fifty-seven thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •