Base | Representation |
---|---|
bin | 110011010011101100111010… |
… | …101001100010110000100111 |
3 | 1002120222100010010000122112201 |
4 | 303103230322221202300213 |
5 | 214034104421301431401 |
6 | 2115532050232355331 |
7 | 65346661121513155 |
oct | 6323547251426047 |
9 | 1076870103018481 |
10 | 225654270733351 |
11 | 6599a491041689 |
12 | 21385386845b47 |
13 | 98bb14ca77335 |
14 | 3da1a214a83d5 |
15 | 1b14bbac5bb01 |
hex | cd3b3aa62c27 |
225654270733351 has 4 divisors (see below), whose sum is σ = 229353521073304. Its totient is φ = 221955020393400.
The previous prime is 225654270733303. The next prime is 225654270733379. The reversal of 225654270733351 is 153337072456522.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 225654270733351 - 27 = 225654270733223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 225654270733292 and 225654270733301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225654270733051) 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, 1849625169885 + ... + 1849625170006.
It is an arithmetic number, because the mean of its divisors is an integer number (57338380268326).
Almost surely, 2225654270733351 is an apocalyptic number.
225654270733351 is a deficient number, since it is larger than the sum of its proper divisors (3699250339953).
225654270733351 is an equidigital number, since it uses as much as digits as its factorization.
225654270733351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3699250339952.
The product of its (nonzero) digits is 31752000, while the sum is 55.
The spelling of 225654270733351 in words is "two hundred twenty-five trillion, six hundred fifty-four billion, two hundred seventy million, seven hundred thirty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •