Base | Representation |
---|---|
bin | 110010100110… |
… | …101101001000 |
3 | 220221222011120 |
4 | 302212231020 |
5 | 11344000421 |
6 | 1152155240 |
7 | 220520421 |
oct | 62465510 |
9 | 26858146 |
10 | 13265736 |
11 | 7540820 |
12 | 4538b20 |
13 | 2996163 |
14 | 1a94648 |
15 | 12708c6 |
hex | ca6b48 |
13265736 has 64 divisors (see below), whose sum is σ = 36590400. Its totient is φ = 3974400.
The previous prime is 13265723. The next prime is 13265767. The reversal of 13265736 is 63756231.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 13265697 and 13265706.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 28546 + ... + 29006.
It is an arithmetic number, because the mean of its divisors is an integer number (571725).
Almost surely, 213265736 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13265736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18295200).
13265736 is an abundant number, since it is smaller than the sum of its proper divisors (23324664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13265736 is a wasteful number, since it uses less digits than its factorization.
13265736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590 (or 586 counting only the distinct ones).
The product of its digits is 22680, while the sum is 33.
The square root of 13265736 is about 3642.2158090920. The cubic root of 13265736 is about 236.7248136788.
The spelling of 13265736 in words is "thirteen million, two hundred sixty-five thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •