Base | Representation |
---|---|
bin | 11001001111110111010111… |
… | …111000000111001000101101 |
3 | 112120011110021212122221020200 |
4 | 121033313113320013020231 |
5 | 104023300302244023341 |
6 | 1032055415314304113 |
7 | 32250322454604243 |
oct | 3117672770071055 |
9 | 476143255587220 |
10 | 111041411314221 |
11 | 32421441930413 |
12 | 1055469bb88039 |
13 | 49c6210b2cb0b |
14 | 1d5c60c170793 |
15 | cc86967dcdb6 |
hex | 64fdd7e0722d |
111041411314221 has 48 divisors (see below), whose sum is σ = 169553355753600. Its totient is φ = 69928215509376.
The previous prime is 111041411314213. The next prime is 111041411314243. The reversal of 111041411314221 is 122413114140111.
111041411314221 is a `hidden beast` number, since 1 + 1 + 1 + 0 + 414 + 1 + 13 + 14 + 221 = 666.
It is not a de Polignac number, because 111041411314221 - 23 = 111041411314213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111041411314261) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22651506 + ... + 27114083.
It is an arithmetic number, because the mean of its divisors is an integer number (3532361578200).
Almost surely, 2111041411314221 is an apocalyptic number.
It is an amenable number.
111041411314221 is a deficient number, since it is larger than the sum of its proper divisors (58511944439379).
111041411314221 is a wasteful number, since it uses less digits than its factorization.
111041411314221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49765810 (or 49765807 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 27.
Adding to 111041411314221 its reverse (122413114140111), we get a palindrome (233454525454332).
The spelling of 111041411314221 in words is "one hundred eleven trillion, forty-one billion, four hundred eleven million, three hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.079 sec. • engine limits •