Base | Representation |
---|---|
bin | 110011110101010101… |
… | …1000001101101010001 |
3 | 101122022110220110010122 |
4 | 1213222223001231101 |
5 | 3310431200031004 |
6 | 123045152040025 |
7 | 11020253460236 |
oct | 1475253015521 |
9 | 348273813118 |
10 | 111311330129 |
11 | 4323038691a |
12 | 196a5b33015 |
13 | a65c0a0cac |
14 | 555d41378d |
15 | 2d672c4cbe |
hex | 19eaac1b51 |
111311330129 has 4 divisors (see below), whose sum is σ = 112652430576. Its totient is φ = 109970229684.
The previous prime is 111311330113. The next prime is 111311330153. The reversal of 111311330129 is 921033113111.
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 111311330129 - 24 = 111311330113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111311330098 and 111311330107.
It is not an unprimeable number, because it can be changed into a prime (111310330129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 670550099 + ... + 670550264.
It is an arithmetic number, because the mean of its divisors is an integer number (28163107644).
Almost surely, 2111311330129 is an apocalyptic number.
It is an amenable number.
111311330129 is a deficient number, since it is larger than the sum of its proper divisors (1341100447).
111311330129 is an equidigital number, since it uses as much as digits as its factorization.
111311330129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1341100446.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 111311330129 in words is "one hundred eleven billion, three hundred eleven million, three hundred thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •