Base | Representation |
---|---|
bin | 10000000001101… |
… | …110010011011101 |
3 | 200201221212222110 |
4 | 100001232103131 |
5 | 1022313343021 |
6 | 42403104233 |
7 | 6443334606 |
oct | 2001562335 |
9 | 621855873 |
10 | 268887261 |
11 | 128863a85 |
12 | 76072079 |
13 | 439264b6 |
14 | 279d4dad |
15 | 18915476 |
hex | 1006e4dd |
268887261 has 4 divisors (see below), whose sum is σ = 358516352. Its totient is φ = 179258172.
The previous prime is 268887253. The next prime is 268887263. The reversal of 268887261 is 162788862.
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 not a de Polignac number, because 268887261 - 23 = 268887253 is a prime.
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 268887261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268887263) 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, 44814541 + ... + 44814546.
It is an arithmetic number, because the mean of its divisors is an integer number (89629088).
Almost surely, 2268887261 is an apocalyptic number.
It is an amenable number.
268887261 is a deficient number, since it is larger than the sum of its proper divisors (89629091).
268887261 is an equidigital number, since it uses as much as digits as its factorization.
268887261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89629090.
The product of its digits is 516096, while the sum is 48.
The square root of 268887261 is about 16397.7821976022. The cubic root of 268887261 is about 645.4412868646.
The spelling of 268887261 in words is "two hundred sixty-eight million, eight hundred eighty-seven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •