Base | Representation |
---|---|
bin | 100000110110000… |
… | …1100001001100111 |
3 | 2211210210122021221 |
4 | 1001230030021213 |
5 | 4224114300033 |
6 | 301205521211 |
7 | 36211502461 |
oct | 10154141147 |
9 | 2753718257 |
10 | 1102103143 |
11 | 516121449 |
12 | 269113207 |
13 | 14743904b |
14 | a6529131 |
15 | 66b4e12d |
hex | 41b0c267 |
1102103143 has 4 divisors (see below), whose sum is σ = 1103717448. Its totient is φ = 1100488840.
The previous prime is 1102103111. The next prime is 1102103207. The reversal of 1102103143 is 3413012011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3413012011 = 277 ⋅12321343.
It is a cyclic number.
It is not a de Polignac number, because 1102103143 - 25 = 1102103111 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 (1102100143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 806128 + ... + 807493.
It is an arithmetic number, because the mean of its divisors is an integer number (275929362).
Almost surely, 21102103143 is an apocalyptic number.
1102103143 is a deficient number, since it is larger than the sum of its proper divisors (1614305).
1102103143 is an equidigital number, since it uses as much as digits as its factorization.
1102103143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1614304.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1102103143 is about 33197.9388366206. The cubic root of 1102103143 is about 1032.9375853148.
Adding to 1102103143 its reverse (3413012011), we get a palindrome (4515115154).
The spelling of 1102103143 in words is "one billion, one hundred two million, one hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •