Base | Representation |
---|---|
bin | 100000110110001… |
… | …0010111110011111 |
3 | 2211210212001122111 |
4 | 1001230102332133 |
5 | 4224121143403 |
6 | 301210254451 |
7 | 36211650133 |
oct | 10154227637 |
9 | 2753761574 |
10 | 1102131103 |
11 | 516140457 |
12 | 269127427 |
13 | 1474489a8 |
14 | a65353c3 |
15 | 66b5756d |
hex | 41b12f9f |
1102131103 has 8 divisors (see below), whose sum is σ = 1126468080. Its totient is φ = 1077996480.
The previous prime is 1102131101. The next prime is 1102131193. The reversal of 1102131103 is 3011312011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102131103 - 21 = 1102131101 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 (1102131101) 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 7 ways as a sum of consecutive naturals, for example, 39550 + ... + 61387.
It is an arithmetic number, because the mean of its divisors is an integer number (140808510).
Almost surely, 21102131103 is an apocalyptic number.
1102131103 is a deficient number, since it is larger than the sum of its proper divisors (24336977).
1102131103 is a wasteful number, since it uses less digits than its factorization.
1102131103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101177.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1102131103 is about 33198.3599444310. The cubic root of 1102131103 is about 1032.9463203383.
Adding to 1102131103 its reverse (3011312011), we get a palindrome (4113443114).
It can be divided in two parts, 11021 and 31103, that added together give a palindrome (42124).
The spelling of 1102131103 in words is "one billion, one hundred two million, one hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •