Base | Representation |
---|---|
bin | 100000011000010011110… |
… | …010110010011010101101 |
3 | 21212201102210111220021110 |
4 | 200120103302302122231 |
5 | 242424024013441031 |
6 | 4422113002022233 |
7 | 316521450423351 |
oct | 40302362623255 |
9 | 7781383456243 |
10 | 2225125140141 |
11 | 788741150712 |
12 | 2bb2b1aa7979 |
13 | 131a9ccc3477 |
14 | 799a77b1461 |
15 | 3cd320e2c46 |
hex | 20613cb26ad |
2225125140141 has 8 divisors (see below), whose sum is σ = 3000168728640. Its totient is φ = 1466749155872.
The previous prime is 2225125140113. The next prime is 2225125140157. The reversal of 2225125140141 is 1410415215222.
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 2225125140141 - 214 = 2225125123757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2225125140099 and 2225125140108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2225125140541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4166900745 + ... + 4166901278.
It is an arithmetic number, because the mean of its divisors is an integer number (375021091080).
Almost surely, 22225125140141 is an apocalyptic number.
It is an amenable number.
2225125140141 is a deficient number, since it is larger than the sum of its proper divisors (775043588499).
2225125140141 is an equidigital number, since it uses as much as digits as its factorization.
2225125140141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8333802115.
The product of its (nonzero) digits is 6400, while the sum is 30.
The spelling of 2225125140141 in words is "two trillion, two hundred twenty-five billion, one hundred twenty-five million, one hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •