Base | Representation |
---|---|
bin | 110010011001… |
… | …001001110001 |
3 | 220212011000121 |
4 | 302121021301 |
5 | 11340211400 |
6 | 1151050241 |
7 | 220166530 |
oct | 62311161 |
9 | 26764017 |
10 | 13210225 |
11 | 7503046 |
12 | 4510981 |
13 | 2976b02 |
14 | 1a7c317 |
15 | 125e21a |
hex | c99271 |
13210225 has 48 divisors (see below), whose sum is σ = 20534400. Its totient is φ = 8225280.
The previous prime is 13210213. The next prime is 13210237. The reversal of 13210225 is 52201231.
13210225 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13210213) and next prime (13210237).
It is not a de Polignac number, because 13210225 - 27 = 13210097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13210199 and 13210208.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 96357 + ... + 96493.
It is an arithmetic number, because the mean of its divisors is an integer number (427800).
Almost surely, 213210225 is an apocalyptic number.
It is an amenable number.
13210225 is a deficient number, since it is larger than the sum of its proper divisors (7324175).
13210225 is a wasteful number, since it uses less digits than its factorization.
13210225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202 (or 197 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 13210225 is about 3634.5873218290. The cubic root of 13210225 is about 236.3941572341.
Adding to 13210225 its reverse (52201231), we get a palindrome (65411456).
The spelling of 13210225 in words is "thirteen million, two hundred ten thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •