Base | Representation |
---|---|
bin | 100001011010001… |
… | …0111100010000011 |
3 | 2220010101221000021 |
4 | 1002310113202003 |
5 | 4243440233011 |
6 | 303123234311 |
7 | 36531355633 |
oct | 10264274203 |
9 | 2803357007 |
10 | 1121024131 |
11 | 525875027 |
12 | 273518997 |
13 | 14b3322b6 |
14 | a8c526c3 |
15 | 6863a471 |
hex | 42d17883 |
1121024131 has 4 divisors (see below), whose sum is σ = 1140024600. Its totient is φ = 1102023664.
The previous prime is 1121024083. The next prime is 1121024143. The reversal of 1121024131 is 1314201211.
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 1121024131 - 219 = 1120499843 is a prime.
It is a super-2 number, since 2×11210241312 = 2513390204568610322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121024161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9500146 + ... + 9500263.
It is an arithmetic number, because the mean of its divisors is an integer number (285006150).
Almost surely, 21121024131 is an apocalyptic number.
1121024131 is a deficient number, since it is larger than the sum of its proper divisors (19000469).
1121024131 is an equidigital number, since it uses as much as digits as its factorization.
1121024131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19000468.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1121024131 is about 33481.6984485554. The cubic root of 1121024131 is about 1038.8152593066.
Adding to 1121024131 its reverse (1314201211), we get a palindrome (2435225342).
The spelling of 1121024131 in words is "one billion, one hundred twenty-one million, twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.991 sec. • engine limits •