Base | Representation |
---|---|
bin | 11110100111001… |
… | …01011110000111 |
3 | 122220012102000200 |
4 | 33103211132013 |
5 | 1011214324310 |
6 | 41251541543 |
7 | 6235462023 |
oct | 1723453607 |
9 | 586172020 |
10 | 256792455 |
11 | 121a52a77 |
12 | 71bba8b3 |
13 | 412802ca |
14 | 26167383 |
15 | 178269c0 |
hex | f4e5787 |
256792455 has 48 divisors (see below), whose sum is σ = 454053600. Its totient is φ = 134233344.
The previous prime is 256792453. The next prime is 256792457. The reversal of 256792455 is 554297652.
It is an interprime number because it is at equal distance from previous prime (256792453) and next prime (256792457).
It is not a de Polignac number, because 256792455 - 21 = 256792453 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 256792455.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256792451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 735621 + ... + 735969.
It is an arithmetic number, because the mean of its divisors is an integer number (9459450).
Almost surely, 2256792455 is an apocalyptic number.
256792455 is a deficient number, since it is larger than the sum of its proper divisors (197261145).
256792455 is a wasteful number, since it uses less digits than its factorization.
256792455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640 (or 637 counting only the distinct ones).
The product of its digits is 756000, while the sum is 45.
The square root of 256792455 is about 16024.7450837759. The cubic root of 256792455 is about 635.6149250208.
The spelling of 256792455 in words is "two hundred fifty-six million, seven hundred ninety-two thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •