Base | Representation |
---|---|
bin | 110011110101010011… |
… | …1000110101110101001 |
3 | 101122022101222012222021 |
4 | 1213222213012232221 |
5 | 3310430414131441 |
6 | 123045114024441 |
7 | 11020241646154 |
oct | 1475247065651 |
9 | 348271865867 |
10 | 111310302121 |
11 | 4322a844527 |
12 | 196a5718121 |
13 | a65bb010c5 |
14 | 555d226c9b |
15 | 2d671703d1 |
hex | 19ea9c6ba9 |
111310302121 has 4 divisors (see below), whose sum is σ = 111312306000. Its totient is φ = 111308298244.
The previous prime is 111310302101. The next prime is 111310302139. The reversal of 111310302121 is 121203013111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111310302121 - 213 = 111310293929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111310302095 and 111310302104.
It is not an unprimeable number, because it can be changed into a prime (111310302101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 916171 + ... + 1030528.
It is an arithmetic number, because the mean of its divisors is an integer number (27828076500).
Almost surely, 2111310302121 is an apocalyptic number.
It is an amenable number.
111310302121 is a deficient number, since it is larger than the sum of its proper divisors (2003879).
111310302121 is an equidigital number, since it uses as much as digits as its factorization.
111310302121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2003878.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 111310302121 its reverse (121203013111), we get a palindrome (232513315232).
The spelling of 111310302121 in words is "one hundred eleven billion, three hundred ten million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •