Base | Representation |
---|---|
bin | 110010011001… |
… | …110101001101 |
3 | 220212021211120 |
4 | 302121311031 |
5 | 11340304010 |
6 | 1151111153 |
7 | 220210611 |
oct | 62316515 |
9 | 26767746 |
10 | 13213005 |
11 | 7505143 |
12 | 45124b9 |
13 | 2978160 |
14 | 1a7d341 |
15 | 125ee70 |
hex | c99d4d |
13213005 has 16 divisors (see below), whose sum is σ = 22767360. Its totient is φ = 6504768.
The previous prime is 13213001. The next prime is 13213043. The reversal of 13213005 is 50031231.
It is a happy number.
It is not a de Polignac number, because 13213005 - 22 = 13213001 is a prime.
It is a super-2 number, since 2×132130052 = 349167002260050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13213001) 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 15 ways as a sum of consecutive naturals, for example, 33685 + ... + 34074.
It is an arithmetic number, because the mean of its divisors is an integer number (1422960).
Almost surely, 213213005 is an apocalyptic number.
13213005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13213005 is a deficient number, since it is larger than the sum of its proper divisors (9554355).
13213005 is a wasteful number, since it uses less digits than its factorization.
13213005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67780.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 13213005 is about 3634.9697385260. The cubic root of 13213005 is about 236.4107385733.
Adding to 13213005 its reverse (50031231), we get a palindrome (63244236).
The spelling of 13213005 in words is "thirteen million, two hundred thirteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •