Base | Representation |
---|---|
bin | 100001011011001… |
… | …0110010011111101 |
3 | 2220011101022100020 |
4 | 1002312112103331 |
5 | 4244103342141 |
6 | 303142322353 |
7 | 36535650615 |
oct | 10266262375 |
9 | 2804338306 |
10 | 1121543421 |
11 | 52609a199 |
12 | 2737293b9 |
13 | 14b48477b |
14 | a8d49a45 |
15 | 686de266 |
hex | 42d964fd |
1121543421 has 8 divisors (see below), whose sum is σ = 1495661760. Its totient is φ = 747560352.
The previous prime is 1121543417. The next prime is 1121543447. The reversal of 1121543421 is 1243451211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121543421 - 22 = 1121543417 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1121543391 and 1121543400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121543021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12561 + ... + 48998.
It is an arithmetic number, because the mean of its divisors is an integer number (186957720).
Almost surely, 21121543421 is an apocalyptic number.
It is an amenable number.
1121543421 is a deficient number, since it is larger than the sum of its proper divisors (374118339).
1121543421 is an equidigital number, since it uses as much as digits as its factorization.
1121543421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67635.
The product of its digits is 960, while the sum is 24.
The square root of 1121543421 is about 33489.4523842956. The cubic root of 1121543421 is about 1038.9756373892.
Adding to 1121543421 its reverse (1243451211), we get a palindrome (2364994632).
The spelling of 1121543421 in words is "one billion, one hundred twenty-one million, five hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •