Base | Representation |
---|---|
bin | 11110100011000… |
… | …01111001001001 |
3 | 122212012000201212 |
4 | 33101201321021 |
5 | 1011100103023 |
6 | 41232222505 |
7 | 6231055535 |
oct | 1721417111 |
9 | 585160655 |
10 | 256253513 |
11 | 12171506a |
12 | 7199aa35 |
13 | 41121bc9 |
14 | 26066bc5 |
15 | 1776be78 |
hex | f461e49 |
256253513 has 4 divisors (see below), whose sum is σ = 269740560. Its totient is φ = 242766468.
The previous prime is 256253489. The next prime is 256253521. The reversal of 256253513 is 315352652.
256253513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 256253513 - 26 = 256253449 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 256253513.
It is not an unprimeable number, because it can be changed into a prime (256253593) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6743495 + ... + 6743532.
It is an arithmetic number, because the mean of its divisors is an integer number (67435140).
Almost surely, 2256253513 is an apocalyptic number.
It is an amenable number.
256253513 is a deficient number, since it is larger than the sum of its proper divisors (13487047).
256253513 is a wasteful number, since it uses less digits than its factorization.
256253513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13487046.
The product of its digits is 27000, while the sum is 32.
The square root of 256253513 is about 16007.9203208912. The cubic root of 256253513 is about 635.1699489315.
The spelling of 256253513 in words is "two hundred fifty-six million, two hundred fifty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •