Base | Representation |
---|---|
bin | 10000000001100… |
… | …011111011010011 |
3 | 200201212201200011 |
4 | 100001203323103 |
5 | 1022311013010 |
6 | 42402135351 |
7 | 6443066644 |
oct | 2001437323 |
9 | 621781604 |
10 | 268844755 |
11 | 128835053 |
12 | 76051557 |
13 | 4391004a |
14 | 279c36cb |
15 | 18907a8a |
hex | 10063ed3 |
268844755 has 4 divisors (see below), whose sum is σ = 322613712. Its totient is φ = 215075800.
The previous prime is 268844753. The next prime is 268844773. The reversal of 268844755 is 557448862.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 268844755 - 21 = 268844753 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 268844699 and 268844708.
It is not an unprimeable number, because it can be changed into a prime (268844753) 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 3 ways as a sum of consecutive naturals, for example, 26884471 + ... + 26884480.
It is an arithmetic number, because the mean of its divisors is an integer number (80653428).
Almost surely, 2268844755 is an apocalyptic number.
268844755 is a deficient number, since it is larger than the sum of its proper divisors (53768957).
268844755 is an equidigital number, since it uses as much as digits as its factorization.
268844755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53768956.
The product of its digits is 2150400, while the sum is 49.
The square root of 268844755 is about 16396.4860564695. The cubic root of 268844755 is about 645.4072743780.
The spelling of 268844755 in words is "two hundred sixty-eight million, eight hundred forty-four thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •