Base | Representation |
---|---|
bin | 11111111111000… |
… | …01101001110101 |
3 | 200200212121201021 |
4 | 33333201221311 |
5 | 1022141424112 |
6 | 42342501141 |
7 | 6435415162 |
oct | 1777415165 |
9 | 620777637 |
10 | 268311157 |
11 | 128500164 |
12 | 75a347b1 |
13 | 437841ca |
14 | 278c5069 |
15 | 1884e907 |
hex | ffe1a75 |
268311157 has 4 divisors (see below), whose sum is σ = 269084736. Its totient is φ = 267537580.
The previous prime is 268311151. The next prime is 268311163. The reversal of 268311157 is 751113862.
It is a happy number.
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 an interprime number because it is at equal distance from previous prime (268311151) and next prime (268311163).
It is a cyclic number.
It is not a de Polignac number, because 268311157 - 23 = 268311149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268311151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 386269 + ... + 386962.
It is an arithmetic number, because the mean of its divisors is an integer number (67271184).
Almost surely, 2268311157 is an apocalyptic number.
It is an amenable number.
268311157 is a deficient number, since it is larger than the sum of its proper divisors (773579).
268311157 is an equidigital number, since it uses as much as digits as its factorization.
268311157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 773578.
The product of its digits is 10080, while the sum is 34.
The square root of 268311157 is about 16380.2062563327. The cubic root of 268311157 is about 644.9799941715.
The spelling of 268311157 in words is "two hundred sixty-eight million, three hundred eleven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •