Base | Representation |
---|---|
bin | 100001011010111… |
… | …1101000100011111 |
3 | 2220011012001111222 |
4 | 1002311331010133 |
5 | 4244042040111 |
6 | 303140203555 |
7 | 36535040315 |
oct | 10265750437 |
9 | 2804161458 |
10 | 1121440031 |
11 | 526029548 |
12 | 2736995bb |
13 | 14b4496aa |
14 | a8d200b5 |
15 | 686bd7db |
hex | 42d7d11f |
1121440031 has 2 divisors, whose sum is σ = 1121440032. Its totient is φ = 1121440030.
The previous prime is 1121440027. The next prime is 1121440039. The reversal of 1121440031 is 1300441211.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1121440031 - 22 = 1121440027 is a prime.
It is a super-2 number, since 2×11214400312 = 2515255486258561922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121439991 and 1121440009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121440039) 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 as a sum of consecutive naturals, namely, 560720015 + 560720016.
It is an arithmetic number, because the mean of its divisors is an integer number (560720016).
Almost surely, 21121440031 is an apocalyptic number.
1121440031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121440031 is an equidigital number, since it uses as much as digits as its factorization.
1121440031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1121440031 is about 33487.9087283754. The cubic root of 1121440031 is about 1038.9437102579.
Adding to 1121440031 its reverse (1300441211), we get a palindrome (2421881242).
The spelling of 1121440031 in words is "one billion, one hundred twenty-one million, four hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •