Base | Representation |
---|---|
bin | 110001100101… |
… | …111110011101 |
3 | 220110111110220 |
4 | 301211332131 |
5 | 11312004410 |
6 | 1142351553 |
7 | 215334432 |
oct | 61457635 |
9 | 26414426 |
10 | 13000605 |
11 | 737a602 |
12 | 442b5b9 |
13 | 2902587 |
14 | 1a25b89 |
15 | 121c070 |
hex | c65f9d |
13000605 has 8 divisors (see below), whose sum is σ = 20800992. Its totient is φ = 6933648.
The previous prime is 13000601. The next prime is 13000627. The reversal of 13000605 is 50600031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13000605 - 22 = 13000601 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 866707 = 13000605 / (1 + 3 + 0 + 0 + 0 + 6 + 0 + 5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 433339 + ... + 433368.
It is an arithmetic number, because the mean of its divisors is an integer number (2600124).
Almost surely, 213000605 is an apocalyptic number.
13000605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13000605 is a deficient number, since it is larger than the sum of its proper divisors (7800387).
13000605 is an equidigital number, since it uses as much as digits as its factorization.
13000605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 866715.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 13000605 is about 3605.6351728926. The cubic root of 13000605 is about 235.1371162988.
Adding to 13000605 its reverse (50600031), we get a palindrome (63600636).
The spelling of 13000605 in words is "thirteen million, six hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •