Base | Representation |
---|---|
bin | 11110011100010… |
… | …01010001010111 |
3 | 122210111221121120 |
4 | 33032021101113 |
5 | 1010333204411 |
6 | 41201215023 |
7 | 6220401651 |
oct | 1716112127 |
9 | 583457546 |
10 | 255366231 |
11 | 12116947a |
12 | 71631473 |
13 | 40ba10a3 |
14 | 25cb56d1 |
15 | 17644106 |
hex | f389457 |
255366231 has 8 divisors (see below), whose sum is σ = 360517104. Its totient is φ = 160229760.
The previous prime is 255366229. The next prime is 255366239. The reversal of 255366231 is 132663552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 255366231 - 21 = 255366229 is a prime.
It is a super-2 number, since 2×2553662312 = 130423823870290722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 255366192 and 255366201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255366239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2503540 + ... + 2503641.
It is an arithmetic number, because the mean of its divisors is an integer number (45064638).
Almost surely, 2255366231 is an apocalyptic number.
255366231 is a deficient number, since it is larger than the sum of its proper divisors (105150873).
255366231 is a wasteful number, since it uses less digits than its factorization.
255366231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5007201.
The product of its digits is 32400, while the sum is 33.
The square root of 255366231 is about 15980.1824457670. The cubic root of 255366231 is about 634.4360057196.
The spelling of 255366231 in words is "two hundred fifty-five million, three hundred sixty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •