Base | Representation |
---|---|
bin | 111100001100111… |
… | …001001110111001 |
3 | 2121101111222112002 |
4 | 330030321032321 |
5 | 4032030404423 |
6 | 244120030345 |
7 | 34012653434 |
oct | 7414711671 |
9 | 2541458462 |
10 | 1010013113 |
11 | 47914288a |
12 | 2423023b5 |
13 | 1313349c5 |
14 | 981d681b |
15 | 5da0d228 |
hex | 3c3393b9 |
1010013113 has 8 divisors (see below), whose sum is σ = 1014845760. Its totient is φ = 1005192400.
The previous prime is 1010013089. The next prime is 1010013149. The reversal of 1010013113 is 3113100101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010013113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010013094 and 1010013103.
It is not an unprimeable number, because it can be changed into a prime (1010013313) 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 7 ways as a sum of consecutive naturals, for example, 197438 + ... + 202488.
It is an arithmetic number, because the mean of its divisors is an integer number (126855720).
Almost surely, 21010013113 is an apocalyptic number.
It is an amenable number.
1010013113 is a deficient number, since it is larger than the sum of its proper divisors (4832647).
1010013113 is an equidigital number, since it uses as much as digits as its factorization.
1010013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5967.
The product of its (nonzero) digits is 9, while the sum is 11.
The square root of 1010013113 is about 31780.7034692437. The cubic root of 1010013113 is about 1003.3266256240.
Adding to 1010013113 its reverse (3113100101), we get a palindrome (4123113214).
The spelling of 1010013113 in words is "one billion, ten million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •