Base | Representation |
---|---|
bin | 1100001010111… |
… | …01100100100000 |
3 | 21010002222012100 |
4 | 12011131210200 |
5 | 202114021021 |
6 | 14044130400 |
7 | 2346536313 |
oct | 605354440 |
9 | 233088170 |
10 | 102095136 |
11 | 526a2650 |
12 | 2a236a00 |
13 | 181c8330 |
14 | d7b897a |
15 | 8e6a626 |
hex | 615d920 |
102095136 has 288 divisors, whose sum is σ = 355537728. Its totient is φ = 27371520.
The previous prime is 102095117. The next prime is 102095153. The reversal of 102095136 is 631590201.
It is a tau number, because it is divible by the number of its divisors (288).
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 47 ways as a sum of consecutive naturals, for example, 1523775 + ... + 1523841.
It is an arithmetic number, because the mean of its divisors is an integer number (1234506).
Almost surely, 2102095136 is an apocalyptic number.
102095136 is a gapful number since it is divisible by the number (16) 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 102095136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177768864).
102095136 is an abundant number, since it is smaller than the sum of its proper divisors (253442592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102095136 is a wasteful number, since it uses less digits than its factorization.
102095136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144 (or 133 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 102095136 is about 10104.2137744606. The cubic root of 102095136 is about 467.3780913125.
The spelling of 102095136 in words is "one hundred two million, ninety-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •