Base | Representation |
---|---|
bin | 110011101010… |
… | …001011010101 |
3 | 221111000021022 |
4 | 303222023111 |
5 | 11431321401 |
6 | 1202130525 |
7 | 223051226 |
oct | 63521325 |
9 | 27430238 |
10 | 13542101 |
11 | 770a421 |
12 | 4650a45 |
13 | 2a61ba1 |
14 | 1b2724d |
15 | 12c771b |
hex | cea2d5 |
13542101 has 16 divisors (see below), whose sum is σ = 14860800. Its totient is φ = 12300288.
The previous prime is 13542097. The next prime is 13542143. The reversal of 13542101 is 10124531.
13542101 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13542101 - 22 = 13542097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13542101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13542161) 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 15 ways as a sum of consecutive naturals, for example, 52565 + ... + 52821.
It is an arithmetic number, because the mean of its divisors is an integer number (928800).
Almost surely, 213542101 is an apocalyptic number.
It is an amenable number.
13542101 is a deficient number, since it is larger than the sum of its proper divisors (1318699).
13542101 is a wasteful number, since it uses less digits than its factorization.
13542101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 13542101 is about 3679.9593747758. The cubic root of 13542101 is about 238.3574237906.
Adding to 13542101 its reverse (10124531), we get a palindrome (23666632).
The spelling of 13542101 in words is "thirteen million, five hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •