Base | Representation |
---|---|
bin | 11001010000101111110100… |
… | …000001100101101111111100 |
3 | 112120101020201022121210010220 |
4 | 121100233310001211233330 |
5 | 104030243410323244400 |
6 | 1032143321001101340 |
7 | 32254566312401415 |
oct | 3120576401455774 |
9 | 476336638553126 |
10 | 111102013103100 |
11 | 3244510aa78358 |
12 | 10564393487850 |
13 | 49cbb4b160ba6 |
14 | 1d6151a91480c |
15 | cca041cb37a0 |
hex | 650bf4065bfc |
111102013103100 has 144 divisors (see below), whose sum is σ = 326832659558496. Its totient is φ = 29131901568000.
The previous prime is 111102013103071. The next prime is 111102013103167. The reversal of 111102013103100 is 1301310201111.
111102013103100 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1111020131031002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 111102013103100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 54577570 + ... + 56576630.
It is an arithmetic number, because the mean of its divisors is an integer number (2269671246934).
Almost surely, 2111102013103100 is an apocalyptic number.
111102013103100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111102013103100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163416329779248).
111102013103100 is an abundant number, since it is smaller than the sum of its proper divisors (215730646455396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111102013103100 is a wasteful number, since it uses less digits than its factorization.
111102013103100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2002176 (or 2002169 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 111102013103100 its reverse (1301310201111), we get a palindrome (112403323304211).
The spelling of 111102013103100 in words is "one hundred eleven trillion, one hundred two billion, thirteen million, one hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •