Base | Representation |
---|---|
bin | 110001110100… |
… | …110001010010 |
3 | 220120120121020 |
4 | 301310301102 |
5 | 11320424302 |
6 | 1143540310 |
7 | 216006210 |
oct | 61646122 |
9 | 26516536 |
10 | 13061202 |
11 | 7411090 |
12 | 445a696 |
13 | 292402b |
14 | 1a3dcb0 |
15 | 122eebc |
hex | c74c52 |
13061202 has 64 divisors (see below), whose sum is σ = 34504704. Its totient is φ = 3191040.
The previous prime is 13061201. The next prime is 13061203. The reversal of 13061202 is 20216031.
It is an interprime number because it is at equal distance from previous prime (13061201) and next prime (13061203).
It is not an unprimeable number, because it can be changed into a prime (13061201) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 7023 + ... + 8685.
It is an arithmetic number, because the mean of its divisors is an integer number (539136).
Almost surely, 213061202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13061202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17252352).
13061202 is an abundant number, since it is smaller than the sum of its proper divisors (21443502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13061202 is a wasteful number, since it uses less digits than its factorization.
13061202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1703.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 13061202 is about 3614.0285001643. The cubic root of 13061202 is about 235.5018819635.
Adding to 13061202 its reverse (20216031), we get a palindrome (33277233).
The spelling of 13061202 in words is "thirteen million, sixty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •