Base | Representation |
---|---|
bin | 1100010001101… |
… | …11011101011100 |
3 | 21011210022110000 |
4 | 12020313131130 |
5 | 202331100422 |
6 | 14115214300 |
7 | 2360244300 |
oct | 610673534 |
9 | 234708400 |
10 | 102987612 |
11 | 53152132 |
12 | 2a5a7390 |
13 | 1844b620 |
14 | d96bd00 |
15 | 9094cac |
hex | 623775c |
102987612 has 180 divisors, whose sum is σ = 337953000. Its totient is φ = 27107136.
The previous prime is 102987601. The next prime is 102987617. The reversal of 102987612 is 216789201.
102987612 is a `hidden beast` number, since 10 + 29 + 8 + 7 + 612 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102987617) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 206139 + ... + 206637.
Almost surely, 2102987612 is an apocalyptic number.
102987612 is a gapful number since it is divisible by the number (12) 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 102987612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168976500).
102987612 is an abundant number, since it is smaller than the sum of its proper divisors (234965388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102987612 is a wasteful number, since it uses less digits than its factorization.
102987612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542 (or 524 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The square root of 102987612 is about 10148.2812337854. The cubic root of 102987612 is about 468.7360213431.
The spelling of 102987612 in words is "one hundred two million, nine hundred eighty-seven thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •