Base | Representation |
---|---|
bin | 110011101101101001… |
… | …0110100111011100110 |
3 | 101121122111102120220000 |
4 | 1213123102310323212 |
5 | 3304414122444402 |
6 | 123003414122130 |
7 | 11011001466603 |
oct | 1473322647346 |
9 | 347574376800 |
10 | 111053328102 |
11 | 43108788102 |
12 | 19633650346 |
13 | a61a7b9282 |
14 | 55370536aa |
15 | 2d4e80ec1c |
hex | 19db4b4ee6 |
111053328102 has 80 divisors (see below), whose sum is σ = 251501030352. Its totient is φ = 36622756800.
The previous prime is 111053328083. The next prime is 111053328109. The reversal of 111053328102 is 201823350111.
111053328102 is a `hidden beast` number, since 1 + 1 + 1 + 0 + 533 + 28 + 102 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111053328109) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 36207573 + ... + 36210639.
Almost surely, 2111053328102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111053328102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125750515176).
111053328102 is an abundant number, since it is smaller than the sum of its proper divisors (140447702250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111053328102 is a wasteful number, since it uses less digits than its factorization.
111053328102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5395 (or 5386 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 111053328102 its reverse (201823350111), we get a palindrome (312876678213).
The spelling of 111053328102 in words is "one hundred eleven billion, fifty-three million, three hundred twenty-eight thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •