Base | Representation |
---|---|
bin | 100001101101110… |
… | …1001101011110111 |
3 | 2220211210010011122 |
4 | 1003123221223313 |
5 | 4304104301403 |
6 | 304132054155 |
7 | 40015036112 |
oct | 10333515367 |
9 | 2824703148 |
10 | 1131322103 |
11 | 53066904a |
12 | 276a6435b |
13 | 1504c9682 |
14 | aa373579 |
15 | 694c1838 |
hex | 436e9af7 |
1131322103 has 8 divisors (see below), whose sum is σ = 1239176880. Its totient is φ = 1028056960.
The previous prime is 1131322081. The next prime is 1131322123. The reversal of 1131322103 is 3012231311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1131322103 - 218 = 1131059959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131322123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1146893 + ... + 1147878.
It is an arithmetic number, because the mean of its divisors is an integer number (154897110).
Almost surely, 21131322103 is an apocalyptic number.
1131322103 is a deficient number, since it is larger than the sum of its proper divisors (107854777).
1131322103 is a wasteful number, since it uses less digits than its factorization.
1131322103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2294817.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1131322103 is about 33635.1319753617. The cubic root of 1131322103 is about 1041.9864962767.
Adding to 1131322103 its reverse (3012231311), we get a palindrome (4143553414).
The spelling of 1131322103 in words is "one billion, one hundred thirty-one million, three hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •