Base | Representation |
---|---|
bin | 100000110110000… |
… | …1011101010000001 |
3 | 2211210210112112001 |
4 | 1001230023222001 |
5 | 4224114213441 |
6 | 301205504001 |
7 | 36211463542 |
oct | 10154135201 |
9 | 2753715461 |
10 | 1102101121 |
11 | 51611a980 |
12 | 269112001 |
13 | 147438154 |
14 | a65284c9 |
15 | 66b4d731 |
hex | 41b0ba81 |
1102101121 has 8 divisors (see below), whose sum is σ = 1219226688. Its totient is φ = 987798000.
The previous prime is 1102101103. The next prime is 1102101127. The reversal of 1102101121 is 1211012011.
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 1102101121 - 29 = 1102100609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102101098 and 1102101107.
It is not an unprimeable number, because it can be changed into a prime (1102101127) 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, 704790 + ... + 706351.
It is an arithmetic number, because the mean of its divisors is an integer number (152403336).
Almost surely, 21102101121 is an apocalyptic number.
1102101121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1102101121 is a deficient number, since it is larger than the sum of its proper divisors (117125567).
1102101121 is a wasteful number, since it uses less digits than its factorization.
1102101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1411223.
The product of its (nonzero) digits is 4, while the sum is 10.
The square root of 1102101121 is about 33197.9083829087. The cubic root of 1102101121 is about 1032.9369536131.
Adding to 1102101121 its reverse (1211012011), we get a palindrome (2313113132).
The spelling of 1102101121 in words is "one billion, one hundred two million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •