Base | Representation |
---|---|
bin | 1110111100000000101… |
… | …0100001111111000101 |
3 | 220112101210002012201022 |
4 | 3233000022201333011 |
5 | 13201033011302311 |
6 | 313520504240525 |
7 | 24353312663300 |
oct | 3570012417705 |
9 | 815353065638 |
10 | 256627056581 |
11 | 99920312a15 |
12 | 4189ba70145 |
13 | 1b27a03784c |
14 | c5c6a0bb37 |
15 | 6a1ea165db |
hex | 3bc02a1fc5 |
256627056581 has 12 divisors (see below), whose sum is σ = 300502349280. Its totient is φ = 218509313400.
The previous prime is 256627056559. The next prime is 256627056583. The reversal of 256627056581 is 185650726652.
256627056581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 256627056581 - 222 = 256622862277 is a prime.
It is a super-2 number, since 2×2566270565812 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256627056583) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17334611 + ... + 17349408.
It is an arithmetic number, because the mean of its divisors is an integer number (25041862440).
Almost surely, 2256627056581 is an apocalyptic number.
It is an amenable number.
256627056581 is a deficient number, since it is larger than the sum of its proper divisors (43875292699).
256627056581 is a wasteful number, since it uses less digits than its factorization.
256627056581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34684184 (or 34684177 counting only the distinct ones).
The product of its (nonzero) digits is 6048000, while the sum is 53.
The spelling of 256627056581 in words is "two hundred fifty-six billion, six hundred twenty-seven million, fifty-six thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •