Base | Representation |
---|---|
bin | 1011111011000… |
… | …01011011101101 |
3 | 20222012020011000 |
4 | 11331201123231 |
5 | 201100420210 |
6 | 13531350513 |
7 | 2323050303 |
oct | 575413355 |
9 | 228166130 |
10 | 100013805 |
11 | 51500941 |
12 | 295b2439 |
13 | 17949b88 |
14 | d3d6273 |
15 | 8ba8ac0 |
hex | 5f616ed |
100013805 has 32 divisors (see below), whose sum is σ = 188265600. Its totient is φ = 50201856.
The previous prime is 100013803. The next prime is 100013827. The reversal of 100013805 is 508310001.
It is a happy number.
It is not a de Polignac number, because 100013805 - 21 = 100013803 is a prime.
It is a super-2 number, since 2×1000138052 = 20005522381156050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100013803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19495 + ... + 24084.
It is an arithmetic number, because the mean of its divisors is an integer number (5883300).
Almost surely, 2100013805 is an apocalyptic number.
100013805 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
100013805 is a deficient number, since it is larger than the sum of its proper divisors (88251795).
100013805 is a wasteful number, since it uses less digits than its factorization.
100013805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43610 (or 43604 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 100013805 is about 10000.6902261794. The cubic root of 100013805 is about 464.1802414231.
Adding to 100013805 its reverse (508310001), we get a palindrome (608323806).
The spelling of 100013805 in words is "one hundred million, thirteen thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •