Base | Representation |
---|---|
bin | 100001101101011… |
… | …1000010111100111 |
3 | 2220211101212002011 |
4 | 1003122320113213 |
5 | 4304031320403 |
6 | 304123455051 |
7 | 40013235151 |
oct | 10332702747 |
9 | 2824355064 |
10 | 1131120103 |
11 | 530540303 |
12 | 276987487 |
13 | 150458749 |
14 | aa31dad1 |
15 | 69481a6d |
hex | 436b85e7 |
1131120103 has 4 divisors (see below), whose sum is σ = 1190652760. Its totient is φ = 1071587448.
The previous prime is 1131120097. The next prime is 1131120113. The reversal of 1131120103 is 3010211311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3010211311 = 89 ⋅33822599.
It is a cyclic number.
It is not a de Polignac number, because 1131120103 - 225 = 1097565671 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131120113) 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 3 ways as a sum of consecutive naturals, for example, 29766300 + ... + 29766337.
It is an arithmetic number, because the mean of its divisors is an integer number (297663190).
Almost surely, 21131120103 is an apocalyptic number.
1131120103 is a deficient number, since it is larger than the sum of its proper divisors (59532657).
1131120103 is an equidigital number, since it uses as much as digits as its factorization.
1131120103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59532656.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1131120103 is about 33632.1290286535. The cubic root of 1131120103 is about 1041.9244762736.
Adding to 1131120103 its reverse (3010211311), we get a palindrome (4141331414).
The spelling of 1131120103 in words is "one billion, one hundred thirty-one million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.334 sec. • engine limits •