Base | Representation |
---|---|
bin | 111100011000010… |
… | …101011101010111 |
3 | 2121121011100122111 |
4 | 330120111131113 |
5 | 4033312343221 |
6 | 244304211451 |
7 | 34050314443 |
oct | 7430253527 |
9 | 2547140574 |
10 | 1013012311 |
11 | 47a901163 |
12 | 243309b87 |
13 | 131b44b8c |
14 | 98777823 |
15 | 5de01be1 |
hex | 3c615757 |
1013012311 has 4 divisors (see below), whose sum is σ = 1047943800. Its totient is φ = 978080824.
The previous prime is 1013012281. The next prime is 1013012317. The reversal of 1013012311 is 1132103101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1013012311 - 25 = 1013012279 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013012291 and 1013012300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013012317) 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 3 ways as a sum of consecutive naturals, for example, 17465701 + ... + 17465758.
It is an arithmetic number, because the mean of its divisors is an integer number (261985950).
Almost surely, 21013012311 is an apocalyptic number.
1013012311 is a deficient number, since it is larger than the sum of its proper divisors (34931489).
1013012311 is an equidigital number, since it uses as much as digits as its factorization.
1013012311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34931488.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1013012311 is about 31827.8543260459. The cubic root of 1013012311 is about 1004.3187584745.
Adding to 1013012311 its reverse (1132103101), we get a palindrome (2145115412).
The spelling of 1013012311 in words is "one billion, thirteen million, twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •