Base | Representation |
---|---|
bin | 11110100100111… |
… | …11000100000000 |
3 | 122212122202102112 |
4 | 33102133010000 |
5 | 1011131112224 |
6 | 41241434452 |
7 | 6233151155 |
oct | 1722370400 |
9 | 585582375 |
10 | 256504064 |
11 | 121876333 |
12 | 71a9ba28 |
13 | 411abc6b |
14 | 260d022c |
15 | 177bb30e |
hex | f49f100 |
256504064 has 36 divisors (see below), whose sum is σ = 513616320. Its totient is φ = 127848960.
The previous prime is 256504063. The next prime is 256504103. The reversal of 256504064 is 460405652.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 256504064.
It is not an unprimeable number, because it can be changed into a prime (256504063) 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, 90509 + ... + 93299.
It is an arithmetic number, because the mean of its divisors is an integer number (14267120).
Almost surely, 2256504064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 256504064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (256808160).
256504064 is an abundant number, since it is smaller than the sum of its proper divisors (257112256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256504064 is an equidigital number, since it uses as much as digits as its factorization.
256504064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3166 (or 3152 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
The square root of 256504064 is about 16015.7442537024. The cubic root of 256504064 is about 635.3768932515.
The spelling of 256504064 in words is "two hundred fifty-six million, five hundred four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •