Base | Representation |
---|---|
bin | 1110111011100101000… |
… | …1000011101100011100 |
3 | 220112002201022112120200 |
4 | 3232321101003230130 |
5 | 13200313344431004 |
6 | 313501211543500 |
7 | 24350406206262 |
oct | 3567121035434 |
9 | 815081275520 |
10 | 256511327004 |
11 | 99870a58639 |
12 | 4186915ab90 |
13 | 1b25c0775ca |
14 | c5b54c4432 |
15 | 6a147a6239 |
hex | 3bb9443b1c |
256511327004 has 18 divisors (see below), whose sum is σ = 648403632240. Its totient is φ = 85503775656.
The previous prime is 256511327003. The next prime is 256511327041. The reversal of 256511327004 is 400723115652.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 7125314639 = 256511327004 / (2 + 5 + 6 + 5 + 1 + 1 + 3 + 2 + 7 + 0 + 0 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 256511327004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256511327003) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3562657284 + ... + 3562657355.
Almost surely, 2256511327004 is an apocalyptic number.
It is an amenable number.
256511327004 is an abundant number, since it is smaller than the sum of its proper divisors (391892305236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256511327004 is a wasteful number, since it uses less digits than its factorization.
256511327004 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7125314649 (or 7125314644 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 256511327004 in words is "two hundred fifty-six billion, five hundred eleven million, three hundred twenty-seven thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •