Base | Representation |
---|---|
bin | 110011010011110101000110… |
… | …001100100100111000010001 |
3 | 1002121000011210021001012102021 |
4 | 303103311012030210320101 |
5 | 214034230413411313131 |
6 | 2115540102005051441 |
7 | 65350421566454605 |
oct | 6323650614447021 |
9 | 1077004707035367 |
10 | 225663054401041 |
11 | 659a3189205184 |
12 | 213870183b6b81 |
13 | 98bbc1c77243a |
14 | 3da2215c89505 |
15 | 1b15031e54e11 |
hex | cd3d46324e11 |
225663054401041 has 4 divisors (see below), whose sum is σ = 226268049185332. Its totient is φ = 225058059616752.
The previous prime is 225663054401003. The next prime is 225663054401089. The reversal of 225663054401041 is 140104450366522.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 121531662739600 + 104131391661441 = 11024140^2 + 10204479^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-225663054401041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (225663054401641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 302497391586 + ... + 302497392331.
It is an arithmetic number, because the mean of its divisors is an integer number (56567012296333).
Almost surely, 2225663054401041 is an apocalyptic number.
It is an amenable number.
225663054401041 is a deficient number, since it is larger than the sum of its proper divisors (604994784291).
225663054401041 is an equidigital number, since it uses as much as digits as its factorization.
225663054401041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 604994784290.
The product of its (nonzero) digits is 691200, while the sum is 43.
The spelling of 225663054401041 in words is "two hundred twenty-five trillion, six hundred sixty-three billion, fifty-four million, four hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •