Base | Representation |
---|---|
bin | 11110100100100… |
… | …00101110100001 |
3 | 122212112202212202 |
4 | 33102100232201 |
5 | 1011122222340 |
6 | 41240302545 |
7 | 6232515032 |
oct | 1722205641 |
9 | 585482782 |
10 | 256445345 |
11 | 121836202 |
12 | 71a71a55 |
13 | 4118b310 |
14 | 260b6a89 |
15 | 177a8c15 |
hex | f490ba1 |
256445345 has 8 divisors (see below), whose sum is σ = 331406376. Its totient is φ = 189374976.
The previous prime is 256445291. The next prime is 256445353. The reversal of 256445345 is 543544652.
It can be written as a sum of positive squares in 4 ways, for example, as 3508129 + 252937216 = 1873^2 + 15904^2 .
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 256445345 - 28 = 256445089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 256445299 and 256445308.
It is an unprimeable number.
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, 1972592 + ... + 1972721.
It is an arithmetic number, because the mean of its divisors is an integer number (41425797).
Almost surely, 2256445345 is an apocalyptic number.
It is an amenable number.
256445345 is a deficient number, since it is larger than the sum of its proper divisors (74961031).
256445345 is a wasteful number, since it uses less digits than its factorization.
256445345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3945331.
The product of its digits is 288000, while the sum is 38.
The square root of 256445345 is about 16013.9109838915. The cubic root of 256445345 is about 635.3284059846.
Adding to 256445345 its reverse (543544652), we get a palindrome (799989997).
The spelling of 256445345 in words is "two hundred fifty-six million, four hundred forty-five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •