Base | Representation |
---|---|
bin | 110011001010101101100111… |
… | …111110110110101110010111 |
3 | 1002111210021200111210010010120 |
4 | 303022231213332312232113 |
5 | 213443444331314113442 |
6 | 2114340211110123023 |
7 | 65254232433115461 |
oct | 6312554776665627 |
9 | 1074707614703116 |
10 | 225036556004247 |
11 | 6578151619a9a9 |
12 | 212a5713350473 |
13 | 9874b1902b100 |
14 | 3d7db82655131 |
15 | 1b03ab5ad54ec |
hex | ccab67fb6b97 |
225036556004247 has 12 divisors (see below), whose sum is σ = 324904850089704. Its totient is φ = 138484034463840.
The previous prime is 225036556004191. The next prime is 225036556004261. The reversal of 225036556004247 is 742400655630522.
It is not a de Polignac number, because 225036556004247 - 210 = 225036556003223 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 225036556004247.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225036556008247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 221929541904 + ... + 221929542917.
It is an arithmetic number, because the mean of its divisors is an integer number (27075404174142).
Almost surely, 2225036556004247 is an apocalyptic number.
225036556004247 is a deficient number, since it is larger than the sum of its proper divisors (99868294085457).
225036556004247 is a wasteful number, since it uses less digits than its factorization.
225036556004247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443859084850 (or 443859084837 counting only the distinct ones).
The product of its (nonzero) digits is 12096000, while the sum is 51.
The spelling of 225036556004247 in words is "two hundred twenty-five trillion, thirty-six billion, five hundred fifty-six million, four thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •