Base | Representation |
---|---|
bin | 10000000001011… |
… | …100100100001101 |
3 | 200201211012022111 |
4 | 100001130210031 |
5 | 1022304031410 |
6 | 42401344021 |
7 | 6442613023 |
oct | 2001344415 |
9 | 621735274 |
10 | 268814605 |
11 | 128814434 |
12 | 76038011 |
13 | 438cc3c7 |
14 | 279b6713 |
15 | 188edb8a |
hex | 1005c90d |
268814605 has 4 divisors (see below), whose sum is σ = 322577532. Its totient is φ = 215051680.
The previous prime is 268814597. The next prime is 268814647. The reversal of 268814605 is 506418862.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58767556 + 210047049 = 7666^2 + 14493^2 .
It is not a de Polignac number, because 268814605 - 23 = 268814597 is a prime.
It is a super-2 number, since 2×2688146052 = 144522583722612050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (40) 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 congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26881456 + ... + 26881465.
It is an arithmetic number, because the mean of its divisors is an integer number (80644383).
Almost surely, 2268814605 is an apocalyptic number.
It is an amenable number.
268814605 is a deficient number, since it is larger than the sum of its proper divisors (53762927).
268814605 is an equidigital number, since it uses as much as digits as its factorization.
268814605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53762926.
The product of its (nonzero) digits is 92160, while the sum is 40.
The square root of 268814605 is about 16395.5666263780. The cubic root of 268814605 is about 645.3831467524.
The spelling of 268814605 in words is "two hundred sixty-eight million, eight hundred fourteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •