Base | Representation |
---|---|
bin | 110010011101… |
… | …001000011111 |
3 | 220212222101101 |
4 | 302131020133 |
5 | 11341222102 |
6 | 1151253531 |
7 | 220265206 |
oct | 62351037 |
9 | 26788341 |
10 | 13226527 |
11 | 7514316 |
12 | 451a2a7 |
13 | 2981362 |
14 | 1a8423d |
15 | 1263e87 |
hex | c9d21f |
13226527 has 8 divisors (see below), whose sum is σ = 14742000. Its totient is φ = 11793024.
The previous prime is 13226513. The next prime is 13226531. The reversal of 13226527 is 72562231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13226527 - 27 = 13226399 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13226495 and 13226504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13226597) 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 7 ways as a sum of consecutive naturals, for example, 20152 + ... + 20797.
It is an arithmetic number, because the mean of its divisors is an integer number (1842750).
Almost surely, 213226527 is an apocalyptic number.
13226527 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
13226527 is a deficient number, since it is larger than the sum of its proper divisors (1515473).
13226527 is a wasteful number, since it uses less digits than its factorization.
13226527 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40985.
The product of its digits is 5040, while the sum is 28.
The square root of 13226527 is about 3636.8292508722. The cubic root of 13226527 is about 236.4913575323.
Adding to 13226527 its reverse (72562231), we get a palindrome (85788758).
The spelling of 13226527 in words is "thirteen million, two hundred twenty-six thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •