Base | Representation |
---|---|
bin | 110010011101… |
… | …111011000001 |
3 | 220220010211011 |
4 | 302131323001 |
5 | 11341323021 |
6 | 1151320521 |
7 | 220310506 |
oct | 62357301 |
9 | 26803734 |
10 | 13229761 |
11 | 7516796 |
12 | 4520141 |
13 | 298297c |
14 | 1a854ad |
15 | 1264de1 |
hex | c9dec1 |
13229761 has 12 divisors (see below), whose sum is σ = 14035140. Its totient is φ = 12467840.
The previous prime is 13229759. The next prime is 13229789. The reversal of 13229761 is 16792231.
13229761 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 5612161 + 7617600 = 2369^2 + 2760^2 .
It is not a de Polignac number, because 13229761 - 21 = 13229759 is a prime.
It is a super-2 number, since 2×132297612 = 350053152234242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13229861) 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 11 ways as a sum of consecutive naturals, for example, 46941 + ... + 47221.
It is an arithmetic number, because the mean of its divisors is an integer number (1169595).
Almost surely, 213229761 is an apocalyptic number.
It is an amenable number.
13229761 is a deficient number, since it is larger than the sum of its proper divisors (805379).
13229761 is an equidigital number, since it uses as much as digits as its factorization.
13229761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416 (or 393 counting only the distinct ones).
The product of its digits is 4536, while the sum is 31.
The square root of 13229761 is about 3637.2738417667. The cubic root of 13229761 is about 236.5106306875.
The spelling of 13229761 in words is "thirteen million, two hundred twenty-nine thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •