Base | Representation |
---|---|
bin | 1100001011000… |
… | …01111101000000 |
3 | 21010010212211020 |
4 | 12011201331000 |
5 | 202120104323 |
6 | 14044345440 |
7 | 2346642540 |
oct | 605417500 |
9 | 233125736 |
10 | 102113088 |
11 | 52705090 |
12 | 2a245280 |
13 | 1820355c |
14 | d7c1320 |
15 | 8e70ae3 |
hex | 6161f40 |
102113088 has 112 divisors (see below), whose sum is σ = 336889344. Its totient is φ = 26519040.
The previous prime is 102113047. The next prime is 102113111. The reversal of 102113088 is 880311201.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11331 + ... + 18237.
Almost surely, 2102113088 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102113088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168444672).
102113088 is an abundant number, since it is smaller than the sum of its proper divisors (234776256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102113088 is a wasteful number, since it uses less digits than its factorization.
102113088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6940 (or 6930 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 24.
The square root of 102113088 is about 10105.1020776635. The cubic root of 102113088 is about 467.4054836712.
Adding to 102113088 its reverse (880311201), we get a palindrome (982424289).
The spelling of 102113088 in words is "one hundred two million, one hundred thirteen thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •