Base | Representation |
---|---|
bin | 1111000111001111… |
… | …01101001101000101 |
3 | 202221110112221210000 |
4 | 13203213231031011 |
5 | 113104113212401 |
6 | 3421042551513 |
7 | 405032124354 |
oct | 74347551505 |
9 | 22843487700 |
10 | 8113804101 |
11 | 3494038127 |
12 | 16a5368599 |
13 | 9c3caab20 |
14 | 56d84d99b |
15 | 3274ca186 |
hex | 1e39ed345 |
8113804101 has 80 divisors (see below), whose sum is σ = 13564793088. Its totient is φ = 4800902400.
The previous prime is 8113804007. The next prime is 8113804109. The reversal of 8113804101 is 1014083118.
It is not a de Polignac number, because 8113804101 - 213 = 8113795909 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8113804109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3063960 + ... + 3066606.
Almost surely, 28113804101 is an apocalyptic number.
8113804101 is a gapful number since it is divisible by the number (81) formed by its first and last digit.
It is an amenable number.
8113804101 is a deficient number, since it is larger than the sum of its proper divisors (5450988987).
8113804101 is a wasteful number, since it uses less digits than its factorization.
8113804101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2784 (or 2775 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 27.
The square root of 8113804101 is about 90076.6568040799. The cubic root of 8113804101 is about 2009.4390571021.
Adding to 8113804101 its reverse (1014083118), we get a palindrome (9127887219).
The spelling of 8113804101 in words is "eight billion, one hundred thirteen million, eight hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •