Base | Representation |
---|---|
bin | 110011101100000011… |
… | …1110100010000010110 |
3 | 101121111210021211111222 |
4 | 1213120013310100112 |
5 | 3304312012010402 |
6 | 122554233330342 |
7 | 11006454240230 |
oct | 1473007642026 |
9 | 347453254458 |
10 | 111000110102 |
11 | 43090739692 |
12 | 196198669b2 |
13 | a60c77522b |
14 | 552dd5d250 |
15 | 2d49ceb7a2 |
hex | 19d81f4416 |
111000110102 has 64 divisors (see below), whose sum is σ = 202208640000. Its totient is φ = 44640554112.
The previous prime is 111000110101. The next prime is 111000110167. The reversal of 111000110102 is 201011000111.
It is a happy number.
It is a super-2 number, since 2×1110001101022 (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 111000110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111000110101) 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 31 ways as a sum of consecutive naturals, for example, 12117308 + ... + 12126464.
It is an arithmetic number, because the mean of its divisors is an integer number (3159510000).
Almost surely, 2111000110102 is an apocalyptic number.
111000110102 is a deficient number, since it is larger than the sum of its proper divisors (91208529898).
111000110102 is a wasteful number, since it uses less digits than its factorization.
111000110102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9613.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 111000110102 its reverse (201011000111), we get a palindrome (312011110213).
The spelling of 111000110102 in words is "one hundred eleven billion, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •