Base | Representation |
---|---|
bin | 100100111110001… |
… | …0010111111111001 |
3 | 10012110022010101101 |
4 | 1021330102333321 |
5 | 10020034340400 |
6 | 323033051401 |
7 | 42512305045 |
oct | 11174227771 |
9 | 3173263341 |
10 | 1240543225 |
11 | 587288539 |
12 | 2a7556b61 |
13 | 16a01b35c |
14 | baa85025 |
15 | 73d9856a |
hex | 49f12ff9 |
1240543225 has 6 divisors (see below), whose sum is σ = 1538273630. Its totient is φ = 992434560.
The previous prime is 1240543223. The next prime is 1240543229. The reversal of 1240543225 is 5223450421.
It can be written as a sum of positive squares in 3 ways, for example, as 245266921 + 995276304 = 15661^2 + 31548^2 .
It is not a de Polignac number, because 1240543225 - 21 = 1240543223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1240543193 and 1240543202.
It is not an unprimeable number, because it can be changed into a prime (1240543223) 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 5 ways as a sum of consecutive naturals, for example, 24810840 + ... + 24810889.
Almost surely, 21240543225 is an apocalyptic number.
It is an amenable number.
1240543225 is a deficient number, since it is larger than the sum of its proper divisors (297730405).
1240543225 is an equidigital number, since it uses as much as digits as its factorization.
1240543225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49621739 (or 49621734 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
The square root of 1240543225 is about 35221.3461554211. The cubic root of 1240543225 is about 1074.4939316215.
Adding to 1240543225 its reverse (5223450421), we get a palindrome (6463993646).
The spelling of 1240543225 in words is "one billion, two hundred forty million, five hundred forty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •