Base | Representation |
---|---|
bin | 10000000001000… |
… | …000111111011111 |
3 | 200201121110101110 |
4 | 100001000333133 |
5 | 1022241423123 |
6 | 42355113103 |
7 | 6441632526 |
oct | 2001007737 |
9 | 621543343 |
10 | 268701663 |
11 | 12874759a |
12 | 75ba2793 |
13 | 4388cb89 |
14 | 279874bd |
15 | 188ca493 |
hex | 10040fdf |
268701663 has 8 divisors (see below), whose sum is σ = 373845888. Its totient is φ = 171345944.
The previous prime is 268701637. The next prime is 268701689. The reversal of 268701663 is 366107862.
It is an interprime number because it is at equal distance from previous prime (268701637) and next prime (268701689).
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 268701663 - 26 = 268701599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268701623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1947045 + ... + 1947182.
It is an arithmetic number, because the mean of its divisors is an integer number (46730736).
Almost surely, 2268701663 is an apocalyptic number.
268701663 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
268701663 is a deficient number, since it is larger than the sum of its proper divisors (105144225).
268701663 is a wasteful number, since it uses less digits than its factorization.
268701663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3894253.
The product of its (nonzero) digits is 72576, while the sum is 39.
The square root of 268701663 is about 16392.1219797804. The cubic root of 268701663 is about 645.2927485464.
The spelling of 268701663 in words is "two hundred sixty-eight million, seven hundred one thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •