Base | Representation |
---|---|
bin | 111101011101011… |
… | …010100011001111 |
3 | 2122212020101020111 |
4 | 331131122203033 |
5 | 4102431333403 |
6 | 250152300451 |
7 | 34360245655 |
oct | 7535324317 |
9 | 2585211214 |
10 | 1031121103 |
11 | 48a04a601 |
12 | 2493a1727 |
13 | 13581553c |
14 | 9ad2cdd5 |
15 | 607cc56d |
hex | 3d75a8cf |
1031121103 has 4 divisors (see below), whose sum is σ = 1031285008. Its totient is φ = 1030957200.
The previous prime is 1031121083. The next prime is 1031121121. The reversal of 1031121103 is 3011211301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3011211301 = 7 ⋅430173043.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1031121103 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 (1031101103) 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 3 ways as a sum of consecutive naturals, for example, 72123 + ... + 85228.
It is an arithmetic number, because the mean of its divisors is an integer number (257821252).
Almost surely, 21031121103 is an apocalyptic number.
1031121103 is a deficient number, since it is larger than the sum of its proper divisors (163905).
1031121103 is an equidigital number, since it uses as much as digits as its factorization.
1031121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163904.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1031121103 is about 32111.0744603789. The cubic root of 1031121103 is about 1010.2679101722.
Adding to 1031121103 its reverse (3011211301), we get a palindrome (4042332404).
The spelling of 1031121103 in words is "one billion, thirty-one million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •