Base | Representation |
---|---|
bin | 1000010110110111… |
… | …1011110101111101 |
3 | 12210100101002210100 |
4 | 2011231323311331 |
5 | 14043303130300 |
6 | 1010340031313 |
7 | 106410452541 |
oct | 20555736575 |
9 | 5710332710 |
10 | 2243411325 |
11 | a51390151 |
12 | 527392539 |
13 | 299a20b2c |
14 | 173d3ba21 |
15 | d1e44700 |
hex | 85b7bd7d |
2243411325 has 36 divisors (see below), whose sum is σ = 4023253780. Its totient is φ = 1194981120.
The previous prime is 2243411323. The next prime is 2243411363. The reversal of 2243411325 is 5231143422.
2243411325 is a `hidden beast` number, since 2 + 243 + 411 + 3 + 2 + 5 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 9998244 + 2233413081 = 3162^2 + 47259^2 .
It is not a de Polignac number, because 2243411325 - 21 = 2243411323 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2243411321) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 186081 + ... + 197769.
Almost surely, 22243411325 is an apocalyptic number.
2243411325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2243411325 is a deficient number, since it is larger than the sum of its proper divisors (1779842455).
2243411325 is a wasteful number, since it uses less digits than its factorization.
2243411325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12558 (or 12550 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 2243411325 is about 47364.6632522601. The cubic root of 2243411325 is about 1309.0903937485.
Adding to 2243411325 its reverse (5231143422), we get a palindrome (7474554747).
The spelling of 2243411325 in words is "two billion, two hundred forty-three million, four hundred eleven thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •