Base | Representation |
---|---|
bin | 11110100010101… |
… | …10011000000101 |
3 | 122212002122000202 |
4 | 33101112120011 |
5 | 1011042100331 |
6 | 41231220245 |
7 | 6230501156 |
oct | 1721263005 |
9 | 585078022 |
10 | 256206341 |
11 | 121692686 |
12 | 71977685 |
13 | 411065b1 |
14 | 2605392d |
15 | 1775cecb |
hex | f456605 |
256206341 has 8 divisors (see below), whose sum is σ = 262922880. Its totient is φ = 249524352.
The previous prime is 256206323. The next prime is 256206359. The reversal of 256206341 is 143602652.
It is an interprime number because it is at equal distance from previous prime (256206323) and next prime (256206359).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 256206341 - 222 = 252012037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256206311) 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 7 ways as a sum of consecutive naturals, for example, 6740 + ... + 23618.
It is an arithmetic number, because the mean of its divisors is an integer number (32865360).
Almost surely, 2256206341 is an apocalyptic number.
It is an amenable number.
256206341 is a deficient number, since it is larger than the sum of its proper divisors (6716539).
256206341 is a wasteful number, since it uses less digits than its factorization.
256206341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17275.
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 256206341 is about 16006.4468574384. The cubic root of 256206341 is about 635.1309718066.
Adding to 256206341 its reverse (143602652), we get a palindrome (399808993).
The spelling of 256206341 in words is "two hundred fifty-six million, two hundred six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •