Base | Representation |
---|---|
bin | 10000000001100… |
… | …011010010100111 |
3 | 200201212121002201 |
4 | 100001203102213 |
5 | 1022310422101 |
6 | 42402115331 |
7 | 6443056234 |
oct | 2001432247 |
9 | 621777081 |
10 | 268842151 |
11 | 1288330a6 |
12 | 7604bb47 |
13 | 4390bac6 |
14 | 279c278b |
15 | 18906e01 |
hex | 100634a7 |
268842151 has 4 divisors (see below), whose sum is σ = 278112600. Its totient is φ = 259571704.
The previous prime is 268842127. The next prime is 268842163. The reversal of 268842151 is 151248862.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-268842151 is a prime.
It is a super-2 number, since 2×2688421512 = 144552204308613602, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 268842151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268842181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4635181 + ... + 4635238.
It is an arithmetic number, because the mean of its divisors is an integer number (69528150).
Almost surely, 2268842151 is an apocalyptic number.
268842151 is a deficient number, since it is larger than the sum of its proper divisors (9270449).
268842151 is an equidigital number, since it uses as much as digits as its factorization.
268842151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9270448.
The product of its digits is 30720, while the sum is 37.
The square root of 268842151 is about 16396.4066490192. The cubic root of 268842151 is about 645.4051905906.
The spelling of 268842151 in words is "two hundred sixty-eight million, eight hundred forty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •