Base | Representation |
---|---|
bin | 110011101110010011… |
… | …1100111101011001101 |
3 | 101121201001020212220011 |
4 | 1213130213213223031 |
5 | 3304440320243140 |
6 | 123005530353221 |
7 | 11011361435236 |
oct | 1473447475315 |
9 | 347631225804 |
10 | 111075556045 |
11 | 4311a28a303 |
12 | 1963ab8b811 |
13 | a62229c7bc |
14 | 5539d9c08d |
15 | 2d51750cea |
hex | 19dc9e7acd |
111075556045 has 8 divisors (see below), whose sum is σ = 133292841624. Its totient is φ = 88858995264.
The previous prime is 111075555991. The next prime is 111075556061. The reversal of 111075556045 is 540655570111.
It can be written as a sum of positive squares in 4 ways, for example, as 2240886244 + 108834669801 = 47338^2 + 329901^2 .
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 111075556045 - 217 = 111075424973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111075555989 and 111075556007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248667 + ... + 532903.
It is an arithmetic number, because the mean of its divisors is an integer number (16661605203).
Almost surely, 2111075556045 is an apocalyptic number.
It is an amenable number.
111075556045 is a deficient number, since it is larger than the sum of its proper divisors (22217285579).
111075556045 is an equidigital number, since it uses as much as digits as its factorization.
111075556045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362399.
The product of its (nonzero) digits is 105000, while the sum is 40.
The spelling of 111075556045 in words is "one hundred eleven billion, seventy-five million, five hundred fifty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •