Base | Representation |
---|---|
bin | 110011010101001010001000… |
… | …100001010000101111011101 |
3 | 1002121022220110121100000101122 |
4 | 303111022020201100233131 |
5 | 214042224413011324203 |
6 | 2120050042155420325 |
7 | 65360133346440245 |
oct | 6325121041205735 |
9 | 1077286417300348 |
10 | 225754361433053 |
11 | 65a28983696812 |
12 | 213a085aa546a5 |
13 | 98c77112c232b |
14 | 3da67d85b8b25 |
15 | 1b175c7e10538 |
hex | cd5288850bdd |
225754361433053 has 2 divisors, whose sum is σ = 225754361433054. Its totient is φ = 225754361433052.
The previous prime is 225754361433049. The next prime is 225754361433079. The reversal of 225754361433053 is 350334163457522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119107494395044 + 106646867038009 = 10913638^2 + 10326997^2 .
It is a cyclic number.
It is not a de Polignac number, because 225754361433053 - 22 = 225754361433049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 225754361432986 and 225754361433004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (225754361433553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112877180716526 + 112877180716527.
It is an arithmetic number, because the mean of its divisors is an integer number (112877180716527).
Almost surely, 2225754361433053 is an apocalyptic number.
It is an amenable number.
225754361433053 is a deficient number, since it is larger than the sum of its proper divisors (1).
225754361433053 is an equidigital number, since it uses as much as digits as its factorization.
225754361433053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27216000, while the sum is 53.
The spelling of 225754361433053 in words is "two hundred twenty-five trillion, seven hundred fifty-four billion, three hundred sixty-one million, four hundred thirty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •