Base | Representation |
---|---|
bin | 100000110101111… |
… | …1000010111100001 |
3 | 2211210122112010211 |
4 | 1001223320113201 |
5 | 4224104201423 |
6 | 301204054121 |
7 | 36211014313 |
oct | 10153702741 |
9 | 2753575124 |
10 | 1102022113 |
11 | 516076585 |
12 | 269094341 |
13 | 14740b1ba |
14 | a65077b3 |
15 | 66b3510d |
hex | 41af85e1 |
1102022113 has 8 divisors (see below), whose sum is σ = 1139719680. Its totient is φ = 1064918400.
The previous prime is 1102022101. The next prime is 1102022143. The reversal of 1102022113 is 3112202011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102022113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102022093 and 1102022102.
It is not an unprimeable number, because it can be changed into a prime (1102022143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 144688 + ... + 152113.
It is an arithmetic number, because the mean of its divisors is an integer number (142464960).
Almost surely, 21102022113 is an apocalyptic number.
It is an amenable number.
1102022113 is a deficient number, since it is larger than the sum of its proper divisors (37697567).
1102022113 is an equidigital number, since it uses as much as digits as its factorization.
1102022113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296927.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1102022113 is about 33196.7184070956. The cubic root of 1102022113 is about 1032.9122697822.
Adding to 1102022113 its reverse (3112202011), we get a palindrome (4214224124).
It can be divided in two parts, 11020 and 22113, that added together give a palindrome (33133).
The spelling of 1102022113 in words is "one billion, one hundred two million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •