Base | Representation |
---|---|
bin | 10001110101011000111… |
… | …000001110010100000001 |
3 | 11100011101011100201201012 |
4 | 101311120320032110001 |
5 | 130034420021004212 |
6 | 2335002451450305 |
7 | 154354304013053 |
oct | 21653070162401 |
9 | 4304334321635 |
10 | 1225556813057 |
11 | 432834963aa5 |
12 | 1796305b6995 |
13 | 8b7532a87b5 |
14 | 434628158d3 |
15 | 21d2d6e9922 |
hex | 11d58e0e501 |
1225556813057 has 2 divisors, whose sum is σ = 1225556813058. Its totient is φ = 1225556813056.
The previous prime is 1225556813023. The next prime is 1225556813071. The reversal of 1225556813057 is 7503186555221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1212368357776 + 13188455281 = 1101076^2 + 114841^2 .
It is a cyclic number.
It is not a de Polignac number, because 1225556813057 - 216 = 1225556747521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1225556812996 and 1225556813014.
It is not a weakly prime, because it can be changed into another prime (1225556813077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 612778406528 + 612778406529.
It is an arithmetic number, because the mean of its divisors is an integer number (612778406529).
Almost surely, 21225556813057 is an apocalyptic number.
It is an amenable number.
1225556813057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1225556813057 is an equidigital number, since it uses as much as digits as its factorization.
1225556813057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520000, while the sum is 50.
The spelling of 1225556813057 in words is "one trillion, two hundred twenty-five billion, five hundred fifty-six million, eight hundred thirteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •