Base | Representation |
---|---|
bin | 111011100111001… |
… | …000001111001101 |
3 | 2120200220000020222 |
4 | 323213020033031 |
5 | 4022012104401 |
6 | 243123521125 |
7 | 33532551431 |
oct | 7347101715 |
9 | 2520800228 |
10 | 1000113101 |
11 | 4735a0859 |
12 | 23ab291a5 |
13 | 12c279800 |
14 | 96b7a9c1 |
15 | 5cc04c1b |
hex | 3b9c83cd |
1000113101 has 6 divisors (see below), whose sum is σ = 1082962890. Its totient is φ = 923181168.
The previous prime is 1000113091. The next prime is 1000113113. The reversal of 1000113101 is 1013110001.
It can be written as a sum of positive squares in 3 ways, for example, as 54612100 + 945501001 = 7390^2 + 30749^2 .
It is not a de Polignac number, because 1000113101 - 210 = 1000112077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000113131) 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 5 ways as a sum of consecutive naturals, for example, 2958746 + ... + 2959083.
It is an arithmetic number, because the mean of its divisors is an integer number (180493815).
Almost surely, 21000113101 is an apocalyptic number.
It is an amenable number.
1000113101 is a deficient number, since it is larger than the sum of its proper divisors (82849789).
1000113101 is an equidigital number, since it uses as much as digits as its factorization.
1000113101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5917855 (or 5917842 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 8.
The square root of 1000113101 is about 31624.5648349507. The cubic root of 1000113101 is about 1000.0376989121.
Adding to 1000113101 its reverse (1013110001), we get a palindrome (2013223102).
The spelling of 1000113101 in words is "one billion, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •