Base | Representation |
---|---|
bin | 111010010110010101000010… |
… | …111111111001101110000011 |
3 | 1020122121201222102121221210102 |
4 | 322112111002333321232003 |
5 | 232113440031001011301 |
6 | 2305442041202353015 |
7 | 105024156464056316 |
oct | 7226250277715603 |
9 | 1218551872557712 |
10 | 256621125016451 |
11 | 74849453a77968 |
12 | 24946a8765b76b |
13 | b026364476280 |
14 | 4752758b5897d |
15 | 1ea04873e8b6b |
hex | e96542ff9b83 |
256621125016451 has 16 divisors (see below), whose sum is σ = 276425106723360. Its totient is φ = 236826274333440.
The previous prime is 256621125016433. The next prime is 256621125016457. The reversal of 256621125016451 is 154610521126652.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-256621125016451 is a prime.
It is a super-3 number, since 3×2566211250164513 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 256621125016396 and 256621125016405.
It is not an unprimeable number, because it can be changed into a prime (256621125016457) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3733777055 + ... + 3733845783.
It is an arithmetic number, because the mean of its divisors is an integer number (17276569170210).
Almost surely, 2256621125016451 is an apocalyptic number.
256621125016451 is a deficient number, since it is larger than the sum of its proper divisors (19803981706909).
256621125016451 is a wasteful number, since it uses less digits than its factorization.
256621125016451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130966.
The product of its (nonzero) digits is 864000, while the sum is 47.
The spelling of 256621125016451 in words is "two hundred fifty-six trillion, six hundred twenty-one billion, one hundred twenty-five million, sixteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •