Base | Representation |
---|---|
bin | 110011101111001100… |
… | …0001000010111001101 |
3 | 101121210002202100002010 |
4 | 1213132120020113031 |
5 | 3310020343100221 |
6 | 123012502451433 |
7 | 11012200225515 |
oct | 1473630102715 |
9 | 347702670063 |
10 | 111105050061 |
11 | 431349a4625 |
12 | 19648a33b79 |
13 | a628428395 |
14 | 553dc78845 |
15 | 2d54129c76 |
hex | 19de6085cd |
111105050061 has 16 divisors (see below), whose sum is σ = 149834016000. Its totient is φ = 73223386368.
The previous prime is 111105050059. The next prime is 111105050099. The reversal of 111105050061 is 160050501111.
It is a happy number.
It is not a de Polignac number, because 111105050061 - 21 = 111105050059 is a prime.
It is a super-2 number, since 2×1111050500612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111105050041) 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 15 ways as a sum of consecutive naturals, for example, 1416700 + ... + 1493066.
It is an arithmetic number, because the mean of its divisors is an integer number (9364626000).
Almost surely, 2111105050061 is an apocalyptic number.
It is an amenable number.
111105050061 is a deficient number, since it is larger than the sum of its proper divisors (38728965939).
111105050061 is an equidigital number, since it uses as much as digits as its factorization.
111105050061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81908.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 111105050061 its reverse (160050501111), we get a palindrome (271155551172).
The spelling of 111105050061 in words is "one hundred eleven billion, one hundred five million, fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •