Base | Representation |
---|---|
bin | 1100001011010… |
… | …10110111000000 |
3 | 21010012201212100 |
4 | 12011222313000 |
5 | 202122241233 |
6 | 14045230400 |
7 | 2350154103 |
oct | 605526700 |
9 | 233181770 |
10 | 102149568 |
11 | 5272a534 |
12 | 2a262400 |
13 | 18217041 |
14 | d7d073a |
15 | 8e7b813 |
hex | 616adc0 |
102149568 has 84 divisors (see below), whose sum is σ = 295661080. Its totient is φ = 33716736.
The previous prime is 102149561. The next prime is 102149599. The reversal of 102149568 is 865941201.
102149568 is a `hidden beast` number, since 102 + 1 + 495 + 68 = 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 (102149561) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61971 + ... + 63597.
Almost surely, 2102149568 is an apocalyptic number.
102149568 is a gapful number since it is divisible by the number (18) 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 102149568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147830540).
102149568 is an abundant number, since it is smaller than the sum of its proper divisors (193511512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102149568 is a wasteful number, since it uses less digits than its factorization.
102149568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1754 (or 1741 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 102149568 is about 10106.9069452528. The cubic root of 102149568 is about 467.4611373988.
The spelling of 102149568 in words is "one hundred two million, one hundred forty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •