Base | Representation |
---|---|
bin | 11110100010111… |
… | …11110100111101 |
3 | 122212011121010112 |
4 | 33101133310331 |
5 | 1011044320203 |
6 | 41232115405 |
7 | 6231022061 |
oct | 1721376475 |
9 | 585147115 |
10 | 256245053 |
11 | 121709779 |
12 | 71995b65 |
13 | 4111b0bc |
14 | 26063aa1 |
15 | 177696d8 |
hex | f45fd3d |
256245053 has 4 divisors (see below), whose sum is σ = 256277340. Its totient is φ = 256212768.
The previous prime is 256245049. The next prime is 256245061. The reversal of 256245053 is 350542652.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 147209689 + 109035364 = 12133^2 + 10442^2 .
It is a cyclic number.
It is not a de Polignac number, because 256245053 - 22 = 256245049 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 (256245853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4943 + ... + 23171.
It is an arithmetic number, because the mean of its divisors is an integer number (64069335).
Almost surely, 2256245053 is an apocalyptic number.
It is an amenable number.
256245053 is a deficient number, since it is larger than the sum of its proper divisors (32287).
256245053 is a wasteful number, since it uses less digits than its factorization.
256245053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32286.
The product of its (nonzero) digits is 36000, while the sum is 32.
The square root of 256245053 is about 16007.6560745163. The cubic root of 256245053 is about 635.1629589825.
The spelling of 256245053 in words is "two hundred fifty-six million, two hundred forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •