Base | Representation |
---|---|
bin | 110011101100000100… |
… | …1010100111011001000 |
3 | 101121111211000221122221 |
4 | 1213120021110323020 |
5 | 3304312112143211 |
6 | 122554250023424 |
7 | 11006460506506 |
oct | 1473011247310 |
9 | 347454027587 |
10 | 111000506056 |
11 | 4309098a120 |
12 | 19619a17b74 |
13 | a60c88351b |
14 | 5530023676 |
15 | 2d49d78c71 |
hex | 19d8254ec8 |
111000506056 has 32 divisors (see below), whose sum is σ = 232584216480. Its totient is φ = 49224169600.
The previous prime is 111000506051. The next prime is 111000506069. The reversal of 111000506056 is 650605000111.
It is a super-2 number, since 2×1110005060562 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111000506056.
It is not an unprimeable number, because it can be changed into a prime (111000506051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15378946 + ... + 15386161.
It is an arithmetic number, because the mean of its divisors is an integer number (7268256765).
Almost surely, 2111000506056 is an apocalyptic number.
It is an amenable number.
111000506056 is an abundant number, since it is smaller than the sum of its proper divisors (121583710424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111000506056 is a wasteful number, since it uses less digits than its factorization.
111000506056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30765165 (or 30765161 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 111000506056 its reverse (650605000111), we get a palindrome (761605506167).
The spelling of 111000506056 in words is "one hundred eleven billion, five hundred six thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •