Base | Representation |
---|---|
bin | 1100001111100… |
… | …10100100000000 |
3 | 21011020222100000 |
4 | 12013302210000 |
5 | 202243033113 |
6 | 14105200000 |
7 | 2354660451 |
oct | 607624400 |
9 | 234228300 |
10 | 102705408 |
11 | 52a7a103 |
12 | 2a490000 |
13 | 18380040 |
14 | d8d7128 |
15 | 903b373 |
hex | 61f2900 |
102705408 has 216 divisors, whose sum is σ = 333319168. Its totient is φ = 31352832.
The previous prime is 102705401. The next prime is 102705409. The reversal of 102705408 is 804507201.
It is a tau number, because it is divible by the number of its divisors (216).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (102705401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 808641 + ... + 808767.
Almost surely, 2102705408 is an apocalyptic number.
102705408 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 102705408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166659584).
102705408 is an abundant number, since it is smaller than the sum of its proper divisors (230613760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102705408 is an equidigital number, since it uses as much as digits as its factorization.
102705408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171 (or 145 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 102705408 is about 10134.3676665098. The cubic root of 102705408 is about 468.3074902330.
The spelling of 102705408 in words is "one hundred two million, seven hundred five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •