Base | Representation |
---|---|
bin | 11110100110000… |
… | …11101100111101 |
3 | 122212221101021221 |
4 | 33103003230331 |
5 | 1011200413031 |
6 | 41244553341 |
7 | 6234344542 |
oct | 1723035475 |
9 | 585841257 |
10 | 256654141 |
11 | 121969067 |
12 | 71b52851 |
13 | 41232373 |
14 | 2612cbc9 |
15 | 177eaa11 |
hex | f4c3b3d |
256654141 has 4 divisors (see below), whose sum is σ = 256738300. Its totient is φ = 256569984.
The previous prime is 256654133. The next prime is 256654157. The reversal of 256654141 is 141456652.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 231192025 + 25462116 = 15205^2 + 5046^2 .
It is a cyclic number.
It is not a de Polignac number, because 256654141 - 23 = 256654133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 256654097 and 256654106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256654121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37326 + ... + 43663.
It is an arithmetic number, because the mean of its divisors is an integer number (64184575).
Almost surely, 2256654141 is an apocalyptic number.
It is an amenable number.
256654141 is a deficient number, since it is larger than the sum of its proper divisors (84159).
256654141 is an equidigital number, since it uses as much as digits as its factorization.
256654141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84158.
The product of its digits is 28800, while the sum is 34.
The square root of 256654141 is about 16020.4288644218. The cubic root of 256654141 is about 635.5007858526.
The spelling of 256654141 in words is "two hundred fifty-six million, six hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •