Base | Representation |
---|---|
bin | 110010100110… |
… | …101011101100 |
3 | 220221222001011 |
4 | 302212223230 |
5 | 11344000034 |
6 | 1152155004 |
7 | 220520230 |
oct | 62465354 |
9 | 26858034 |
10 | 13265644 |
11 | 7540747 |
12 | 4538a64 |
13 | 29960c2 |
14 | 1a945c0 |
15 | 1270864 |
hex | ca6aec |
13265644 has 72 divisors (see below), whose sum is σ = 30028320. Its totient is φ = 4999680.
The previous prime is 13265639. The next prime is 13265657. The reversal of 13265644 is 44656231.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 427909 + ... + 427939.
It is an arithmetic number, because the mean of its divisors is an integer number (417060).
Almost surely, 213265644 is an apocalyptic number.
13265644 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13265644, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15014160).
13265644 is an abundant number, since it is smaller than the sum of its proper divisors (16762676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13265644 is a wasteful number, since it uses less digits than its factorization.
13265644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119 (or 86 counting only the distinct ones).
The product of its digits is 17280, while the sum is 31.
The square root of 13265644 is about 3642.2031793957. The cubic root of 13265644 is about 236.7242664361.
The spelling of 13265644 in words is "thirteen million, two hundred sixty-five thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •