Base | Representation |
---|---|
bin | 111100011001011… |
… | …011101110010001 |
3 | 2121121200222102211 |
4 | 330121123232101 |
5 | 4033401100423 |
6 | 244314312121 |
7 | 34052623510 |
oct | 7431335621 |
9 | 2547628384 |
10 | 1013300113 |
11 | 47aa88411 |
12 | 243428641 |
13 | 131c15b87 |
14 | 98810677 |
15 | 5de5c10d |
hex | 3c65bb91 |
1013300113 has 8 divisors (see below), whose sum is σ = 1226178432. Its totient is φ = 817452096.
The previous prime is 1013300111. The next prime is 1013300129. The reversal of 1013300113 is 3110033101.
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 not a de Polignac number, because 1013300113 - 21 = 1013300111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013300093 and 1013300102.
It is not an unprimeable number, because it can be changed into a prime (1013300111) 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, 4257445 + ... + 4257682.
It is an arithmetic number, because the mean of its divisors is an integer number (153272304).
Almost surely, 21013300113 is an apocalyptic number.
It is an amenable number.
1013300113 is a deficient number, since it is larger than the sum of its proper divisors (212878319).
1013300113 is an equidigital number, since it uses as much as digits as its factorization.
1013300113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8515151.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 1013300113 is about 31832.3752334004. The cubic root of 1013300113 is about 1004.4138601745.
Adding to 1013300113 its reverse (3110033101), we get a palindrome (4123333214).
The spelling of 1013300113 in words is "one billion, thirteen million, three hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •