Base | Representation |
---|---|
bin | 10000000001000… |
… | …111010100011101 |
3 | 200201122202221101 |
4 | 100001013110131 |
5 | 1022243240311 |
6 | 42355433101 |
7 | 6442101223 |
oct | 2001072435 |
9 | 621582841 |
10 | 268727581 |
11 | 128765011 |
12 | 75bb5791 |
13 | 4389b905 |
14 | 27992b13 |
15 | 188d2ec1 |
hex | 1004751d |
268727581 has 2 divisors, whose sum is σ = 268727582. Its totient is φ = 268727580.
The previous prime is 268727531. The next prime is 268727617. The reversal of 268727581 is 185727862.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 268632100 + 95481 = 16390^2 + 309^2 .
It is a cyclic number.
It is not a de Polignac number, because 268727581 - 27 = 268727453 is a prime.
It is a super-2 number, since 2×2687275812 = 144429025580223122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (268727531) 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 as a sum of consecutive naturals, namely, 134363790 + 134363791.
It is an arithmetic number, because the mean of its divisors is an integer number (134363791).
Almost surely, 2268727581 is an apocalyptic number.
It is an amenable number.
268727581 is a deficient number, since it is larger than the sum of its proper divisors (1).
268727581 is an equidigital number, since it uses as much as digits as its factorization.
268727581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 376320, while the sum is 46.
The square root of 268727581 is about 16392.9125234047. The cubic root of 268727581 is about 645.3134954218.
It can be divided in two parts, 26872 and 7581, that added together give a triangular number (34453 = T262).
The spelling of 268727581 in words is "two hundred sixty-eight million, seven hundred twenty-seven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •