Base | Representation |
---|---|
bin | 100001001011000… |
… | …1001001101000001 |
3 | 2212120111101200110 |
4 | 1002112021031001 |
5 | 4234423213441 |
6 | 302241341533 |
7 | 36404126526 |
oct | 10226111501 |
9 | 2776441613 |
10 | 1113101121 |
11 | 521353390 |
12 | 2709378a9 |
13 | 1497b9c22 |
14 | a7b8d14d |
15 | 67ac2b16 |
hex | 42589341 |
1113101121 has 16 divisors (see below), whose sum is σ = 1634780160. Its totient is φ = 668055120.
The previous prime is 1113101117. The next prime is 1113101147. The reversal of 1113101121 is 1211013111.
It is not a de Polignac number, because 1113101121 - 22 = 1113101117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113101097 and 1113101106.
It is not an unprimeable number, because it can be changed into a prime (1113101921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 160341 + ... + 167138.
It is an arithmetic number, because the mean of its divisors is an integer number (102173760).
Almost surely, 21113101121 is an apocalyptic number.
1113101121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1113101121 is a deficient number, since it is larger than the sum of its proper divisors (521679039).
1113101121 is a wasteful number, since it uses less digits than its factorization.
1113101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327596.
The product of its (nonzero) digits is 6, while the sum is 12.
The square root of 1113101121 is about 33363.1701281518. The cubic root of 1113101121 is about 1036.3621422073.
Adding to 1113101121 its reverse (1211013111), we get a palindrome (2324114232).
The spelling of 1113101121 in words is "one billion, one hundred thirteen million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •