Base | Representation |
---|---|
bin | 110011010001100000101010… |
… | …110111010111000010110001 |
3 | 1002120102221102022212122220101 |
4 | 303101200222313113002301 |
5 | 214024123020102031221 |
6 | 2115334543354512401 |
7 | 65333050314115315 |
oct | 6321405267270261 |
9 | 1076387368778811 |
10 | 225503682064561 |
11 | 659416357249aa |
12 | 2136015aa35701 |
13 | 98a9ba1568a64 |
14 | 3d9861787db45 |
15 | 1b10d0564bd91 |
hex | cd182add70b1 |
225503682064561 has 32 divisors (see below), whose sum is σ = 246729404736000. Its totient is φ = 205616485331712.
The previous prime is 225503682064543. The next prime is 225503682064627. The reversal of 225503682064561 is 165460286305522.
It is not a de Polignac number, because 225503682064561 - 229 = 225503145193649 is a prime.
It is a super-2 number, since 2×2255036820645612 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (225503682064501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17543466 + ... + 27545971.
It is an arithmetic number, because the mean of its divisors is an integer number (7710293898000).
Almost surely, 2225503682064561 is an apocalyptic number.
It is an amenable number.
225503682064561 is a deficient number, since it is larger than the sum of its proper divisors (21225722671439).
225503682064561 is a wasteful number, since it uses less digits than its factorization.
225503682064561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45089641.
The product of its (nonzero) digits is 20736000, while the sum is 55.
The spelling of 225503682064561 in words is "two hundred twenty-five trillion, five hundred three billion, six hundred eighty-two million, sixty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •