Base | Representation |
---|---|
bin | 110011010100011100101100… |
… | …001011000000110001101001 |
3 | 1002121011020112001212011201201 |
4 | 303110130230023000301221 |
5 | 214040430000232100421 |
6 | 2120011412315244201 |
7 | 65353455240460366 |
oct | 6324345413006151 |
9 | 1077136461764651 |
10 | 225705567456361 |
11 | 65a0a214773943 |
12 | 21393301a49661 |
13 | 98c2c36375585 |
14 | 3da42ca10546d |
15 | 1b161be395b91 |
hex | cd472c2c0c69 |
225705567456361 has 8 divisors (see below), whose sum is σ = 227254464324800. Its totient is φ = 224160817568688.
The previous prime is 225705567456337. The next prime is 225705567456401. The reversal of 225705567456361 is 163654765507522.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 225705567456361 - 25 = 225705567456329 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 225705567456293 and 225705567456302.
It is not an unprimeable number, because it can be changed into a prime (225705567456311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1036635966 + ... + 1036853671.
It is an arithmetic number, because the mean of its divisors is an integer number (28406808040600).
Almost surely, 2225705567456361 is an apocalyptic number.
It is an amenable number.
225705567456361 is a deficient number, since it is larger than the sum of its proper divisors (1548896868439).
225705567456361 is a wasteful number, since it uses less digits than its factorization.
225705567456361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2073490383.
The product of its (nonzero) digits is 317520000, while the sum is 64.
The spelling of 225705567456361 in words is "two hundred twenty-five trillion, seven hundred five billion, five hundred sixty-seven million, four hundred fifty-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •