Base | Representation |
---|---|
bin | 110010011001… |
… | …001100011101 |
3 | 220212011020222 |
4 | 302121030131 |
5 | 11340213042 |
6 | 1151051125 |
7 | 220200164 |
oct | 62311435 |
9 | 26764228 |
10 | 13210397 |
11 | 7503192 |
12 | 4510aa5 |
13 | 2976c05 |
14 | 1a7c3db |
15 | 125e2d2 |
hex | c9931d |
13210397 has 4 divisors (see below), whose sum is σ = 13241340. Its totient is φ = 13179456.
The previous prime is 13210391. The next prime is 13210403. The reversal of 13210397 is 79301231.
13210397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (13210391) and next prime (13210403).
It can be written as a sum of positive squares in 2 ways, for example, as 436921 + 12773476 = 661^2 + 3574^2 .
It is a cyclic number.
It is not a de Polignac number, because 13210397 - 216 = 13144861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210391) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14822 + ... + 15687.
It is an arithmetic number, because the mean of its divisors is an integer number (3310335).
Almost surely, 213210397 is an apocalyptic number.
It is an amenable number.
13210397 is a deficient number, since it is larger than the sum of its proper divisors (30943).
13210397 is an equidigital number, since it uses as much as digits as its factorization.
13210397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30942.
The product of its (nonzero) digits is 1134, while the sum is 26.
The square root of 13210397 is about 3634.6109833103. The cubic root of 13210397 is about 236.3951831974.
The spelling of 13210397 in words is "thirteen million, two hundred ten thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •