Base | Representation |
---|---|
bin | 100001011010111… |
… | …1010110111110111 |
3 | 2220011011121011122 |
4 | 1002311322313313 |
5 | 4244041243111 |
6 | 303140054155 |
7 | 36535002140 |
oct | 10265726767 |
9 | 2804147148 |
10 | 1121431031 |
11 | 526022806 |
12 | 27369435b |
13 | 14b445576 |
14 | a8d1aac7 |
15 | 686bacdb |
hex | 42d7adf7 |
1121431031 has 4 divisors (see below), whose sum is σ = 1281635472. Its totient is φ = 961226592.
The previous prime is 1121431009. The next prime is 1121431049. The reversal of 1121431031 is 1301341211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1301341211 = 17 ⋅76549483.
It is a cyclic number.
It is not a de Polignac number, because 1121431031 - 214 = 1121414647 is a prime.
It is a super-2 number, since 2×11214310312 = 2515215114579445922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121431001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80102210 + ... + 80102223.
It is an arithmetic number, because the mean of its divisors is an integer number (320408868).
Almost surely, 21121431031 is an apocalyptic number.
1121431031 is a deficient number, since it is larger than the sum of its proper divisors (160204441).
1121431031 is an equidigital number, since it uses as much as digits as its factorization.
1121431031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160204440.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1121431031 is about 33487.7743512465. The cubic root of 1121431031 is about 1038.9409309390.
Adding to 1121431031 its reverse (1301341211), we get a palindrome (2422772242).
The spelling of 1121431031 in words is "one billion, one hundred twenty-one million, four hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •