Base | Representation |
---|---|
bin | 111010011000000110100100… |
… | …111011111010111100100001 |
3 | 1020200001101122000010201222101 |
4 | 322120012210323322330201 |
5 | 232122434204432134403 |
6 | 2310014041330010401 |
7 | 105036033361535335 |
oct | 7230064473727441 |
9 | 1220041560121871 |
10 | 256743027224353 |
11 | 74896119655a2a |
12 | 24966628416a01 |
13 | b0349c0788137 |
14 | 47586009817c5 |
15 | 1ea371e39671d |
hex | e981a4efaf21 |
256743027224353 has 8 divisors (see below), whose sum is σ = 259241406211008. Its totient is φ = 254244758396304.
The previous prime is 256743027224311. The next prime is 256743027224399. The reversal of 256743027224353 is 353422720347652.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 256743027224353 - 237 = 256605588270881 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 256743027224294 and 256743027224303.
It is not an unprimeable number, because it can be changed into a prime (256743027294353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22851775 + ... + 32182132.
It is an arithmetic number, because the mean of its divisors is an integer number (32405175776376).
Almost surely, 2256743027224353 is an apocalyptic number.
It is an amenable number.
256743027224353 is a deficient number, since it is larger than the sum of its proper divisors (2498378986655).
256743027224353 is a wasteful number, since it uses less digits than its factorization.
256743027224353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55079303.
The product of its (nonzero) digits is 50803200, while the sum is 55.
The spelling of 256743027224353 in words is "two hundred fifty-six trillion, seven hundred forty-three billion, twenty-seven million, two hundred twenty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.276 sec. • engine limits •