Base | Representation |
---|---|
bin | 111100011001100… |
… | …110010101110101 |
3 | 2121121210012002122 |
4 | 330121212111311 |
5 | 4033403443410 |
6 | 244315245325 |
7 | 34053164351 |
oct | 7431462565 |
9 | 2547705078 |
10 | 1013343605 |
11 | 48000805a |
12 | 243449845 |
13 | 131c2c901 |
14 | 98822461 |
15 | 5de69e55 |
hex | 3c666575 |
1013343605 has 32 divisors (see below), whose sum is σ = 1272289248. Its totient is φ = 774144000.
The previous prime is 1013343601. The next prime is 1013343613. The reversal of 1013343605 is 5063433101.
It can be written as a sum of positive squares in 16 ways, for example, as 131044 + 1013212561 = 362^2 + 31831^2 .
It is not a de Polignac number, because 1013343605 - 22 = 1013343601 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 (1013343601) 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 31 ways as a sum of consecutive naturals, for example, 3606065 + ... + 3606345.
It is an arithmetic number, because the mean of its divisors is an integer number (39759039).
Almost surely, 21013343605 is an apocalyptic number.
It is an amenable number.
1013343605 is a deficient number, since it is larger than the sum of its proper divisors (258945643).
1013343605 is a wasteful number, since it uses less digits than its factorization.
1013343605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617.
The product of its (nonzero) digits is 3240, while the sum is 26.
The square root of 1013343605 is about 31833.0583670498. The cubic root of 1013343605 is about 1004.4282301662.
Adding to 1013343605 its reverse (5063433101), we get a palindrome (6076776706).
The spelling of 1013343605 in words is "one billion, thirteen million, three hundred forty-three thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •