Base | Representation |
---|---|
bin | 110011111000… |
… | …100100011100 |
3 | 221121000010200 |
4 | 303320210130 |
5 | 11440213202 |
6 | 1203303500 |
7 | 223415133 |
oct | 63704434 |
9 | 27530120 |
10 | 13601052 |
11 | 774a743 |
12 | 467ab90 |
13 | 2a8297a |
14 | 1b4091a |
15 | 12d9e1c |
hex | cf891c |
13601052 has 36 divisors (see below), whose sum is σ = 35313096. Its totient is φ = 4410720.
The previous prime is 13601051. The next prime is 13601057. The reversal of 13601052 is 25010631.
13601052 is a `hidden beast` number, since 13 + 601 + 0 + 52 = 666.
13601052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13601051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3774 + ... + 6437.
Almost surely, 213601052 is an apocalyptic number.
13601052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13601052 is an abundant number, since it is smaller than the sum of its proper divisors (21712044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13601052 is a wasteful number, since it uses less digits than its factorization.
13601052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10258 (or 10253 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 13601052 is about 3687.9604119350. The cubic root of 13601052 is about 238.7027928558.
Adding to 13601052 its reverse (25010631), we get a palindrome (38611683).
The spelling of 13601052 in words is "thirteen million, six hundred one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •