Base | Representation |
---|---|
bin | 1100001110001… |
… | …10000010000000 |
3 | 21010220201010110 |
4 | 12013012002000 |
5 | 202221214013 |
6 | 14101231320 |
7 | 2353300620 |
oct | 607060200 |
9 | 233821113 |
10 | 102523008 |
11 | 52965065 |
12 | 2a402540 |
13 | 18318003 |
14 | d88a880 |
15 | 90022c3 |
hex | 61c6080 |
102523008 has 128 divisors (see below), whose sum is σ = 318827520. Its totient is φ = 28578816.
The previous prime is 102522997. The next prime is 102523021. The reversal of 102523008 is 800325201.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115141 + ... + 116027.
It is an arithmetic number, because the mean of its divisors is an integer number (2490840).
Almost surely, 2102523008 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 102523008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159413760).
102523008 is an abundant number, since it is smaller than the sum of its proper divisors (216304512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102523008 is an equidigital number, since it uses as much as digits as its factorization.
102523008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 954 (or 942 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 102523008 is about 10125.3645860285. The cubic root of 102523008 is about 468.0300952230.
Adding to 102523008 its reverse (800325201), we get a palindrome (902848209).
The spelling of 102523008 in words is "one hundred two million, five hundred twenty-three thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •