Base | Representation |
---|---|
bin | 11110100100011… |
… | …01001000110010 |
3 | 122212112000201012 |
4 | 33102031020302 |
5 | 1011121240032 |
6 | 41240110522 |
7 | 6232424126 |
oct | 1722151062 |
9 | 585460635 |
10 | 256430642 |
11 | 121826156 |
12 | 71a65442 |
13 | 41184710 |
14 | 260b1586 |
15 | 177a46b2 |
hex | f48d232 |
256430642 has 32 divisors (see below), whose sum is σ = 424025280. Its totient is φ = 115577280.
The previous prime is 256430563. The next prime is 256430663. The reversal of 256430642 is 246034652.
It is a junction number, because it is equal to n+sod(n) for n = 256430599 and 256430608.
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 15 ways as a sum of consecutive naturals, for example, 522017 + ... + 522507.
It is an arithmetic number, because the mean of its divisors is an integer number (13250790).
Almost surely, 2256430642 is an apocalyptic number.
256430642 is a deficient number, since it is larger than the sum of its proper divisors (167594638).
256430642 is a wasteful number, since it uses less digits than its factorization.
256430642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938.
The product of its (nonzero) digits is 34560, while the sum is 32.
The square root of 256430642 is about 16013.4519076931. The cubic root of 256430642 is about 635.3162638105.
The spelling of 256430642 in words is "two hundred fifty-six million, four hundred thirty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •