Base | Representation |
---|---|
bin | 11110101000010… |
… | …11011101100001 |
3 | 122220111022111000 |
4 | 33110023131201 |
5 | 1011234314230 |
6 | 41255142213 |
7 | 6240010503 |
oct | 1724133541 |
9 | 586438430 |
10 | 256948065 |
11 | 122049980 |
12 | 72074969 |
13 | 4130609a |
14 | 261a7d73 |
15 | 17857b60 |
hex | f50b761 |
256948065 has 64 divisors (see below), whose sum is σ = 520058880. Its totient is φ = 119148480.
The previous prime is 256948061. The next prime is 256948079. The reversal of 256948065 is 560849652.
256948065 is a `hidden beast` number, since 2 + 569 + 4 + 80 + 6 + 5 = 666.
It is not a de Polignac number, because 256948065 - 22 = 256948061 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
Together with 263110815 it forms an amicable pair .
It is a self number, because there is not a number n which added to its sum of digits gives 256948065.
It is not an unprimeable number, because it can be changed into a prime (256948061) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 30394 + ... + 37916.
It is an arithmetic number, because the mean of its divisors is an integer number (8125920).
Almost surely, 2256948065 is an apocalyptic number.
It is an amenable number.
256948065 is an abundant number, since it is smaller than the sum of its proper divisors (263110815).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256948065 is a wasteful number, since it uses less digits than its factorization.
256948065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7571 (or 7565 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 45.
The square root of 256948065 is about 16029.5996518940. The cubic root of 256948065 is about 635.7432881725.
The spelling of 256948065 in words is "two hundred fifty-six million, nine hundred forty-eight thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •