Base | Representation |
---|---|
bin | 110011111011… |
… | …000000101100 |
3 | 221121111212001 |
4 | 303323000230 |
5 | 11441023202 |
6 | 1203422044 |
7 | 223456240 |
oct | 63730054 |
9 | 27544761 |
10 | 13611052 |
11 | 7757204 |
12 | 4684924 |
13 | 2a873a0 |
14 | 1b44420 |
15 | 12dcd87 |
hex | cfb02c |
13611052 has 48 divisors (see below), whose sum is σ = 29845312. Its totient is φ = 5287680.
The previous prime is 13611047. The next prime is 13611053. The reversal of 13611052 is 25011631.
13611052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (13611053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21898 + ... + 22510.
Almost surely, 213611052 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 13611052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14922656).
13611052 is an abundant number, since it is smaller than the sum of its proper divisors (16234260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13611052 is a wasteful number, since it uses less digits than its factorization.
13611052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 698 (or 696 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 13611052 is about 3689.3159257510. The cubic root of 13611052 is about 238.7612795855.
Adding to 13611052 its reverse (25011631), we get a palindrome (38622683).
It can be divided in two parts, 13 and 611052, that added together give a triangular number (611065 = T1105).
The spelling of 13611052 in words is "thirteen million, six hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •