Base | Representation |
---|---|
bin | 111100011001000… |
… | …100000101110001 |
3 | 2121121112001122122 |
4 | 330121010011301 |
5 | 4033340001223 |
6 | 244312244025 |
7 | 34052041343 |
oct | 7431040561 |
9 | 2547461578 |
10 | 1013203313 |
11 | 47aa21711 |
12 | 2433a0615 |
13 | 131bb0ab5 |
14 | 987c7293 |
15 | 5de3d5c8 |
hex | 3c644171 |
1013203313 has 8 divisors (see below), whose sum is σ = 1024358400. Its totient is φ = 1002086848.
The previous prime is 1013203309. The next prime is 1013203339. The reversal of 1013203313 is 3133023101.
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 1013203313 - 22 = 1013203309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013203291 and 1013203300.
It is not an unprimeable number, because it can be changed into a prime (1013203813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44768 + ... + 63486.
It is an arithmetic number, because the mean of its divisors is an integer number (128044800).
Almost surely, 21013203313 is an apocalyptic number.
It is an amenable number.
1013203313 is a deficient number, since it is larger than the sum of its proper divisors (11155087).
1013203313 is a wasteful number, since it uses less digits than its factorization.
1013203313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19311.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 1013203313 is about 31830.8547324762. The cubic root of 1013203313 is about 1004.3818754556.
Adding to 1013203313 its reverse (3133023101), we get a palindrome (4146226414).
The spelling of 1013203313 in words is "one billion, thirteen million, two hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •