Base | Representation |
---|---|
bin | 1011111110110… |
… | …01100011010000 |
3 | 21000010020001100 |
4 | 11333121203100 |
5 | 201212141213 |
6 | 13550104400 |
7 | 2330166564 |
oct | 577314320 |
9 | 230106040 |
10 | 100505808 |
11 | 51807557 |
12 | 297ab100 |
13 | 17a8cac0 |
14 | d4c36a4 |
15 | 8c54773 |
hex | 5fd98d0 |
100505808 has 120 divisors (see below), whose sum is σ = 308933352. Its totient is φ = 30311424.
The previous prime is 100505789. The next prime is 100505809. The reversal of 100505808 is 808505001.
It can be written as a sum of positive squares in 4 ways, for example, as 345744 + 100160064 = 588^2 + 10008^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100505809) 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, 98710 + ... + 99722.
Almost surely, 2100505808 is an apocalyptic number.
100505808 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 100505808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154466676).
100505808 is an abundant number, since it is smaller than the sum of its proper divisors (208427544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100505808 is a wasteful number, since it uses less digits than its factorization.
100505808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093 (or 1084 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 27.
The square root of 100505808 is about 10025.2585004079. The cubic root of 100505808 is about 464.9401518536.
The spelling of 100505808 in words is "one hundred million, five hundred five thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •