Base | Representation |
---|---|
bin | 110011010100… |
… | …001101000101 |
3 | 221022102210222 |
4 | 303110031011 |
5 | 11420431401 |
6 | 1200154125 |
7 | 222224645 |
oct | 63241505 |
9 | 27272728 |
10 | 13452101 |
11 | 7658843 |
12 | 4608945 |
13 | 2a2cc30 |
14 | 1b02525 |
15 | 12aac1b |
hex | cd4345 |
13452101 has 8 divisors (see below), whose sum is σ = 14569464. Its totient is φ = 12346560.
The previous prime is 13452091. The next prime is 13452113. The reversal of 13452101 is 10125431.
It can be written as a sum of positive squares in 4 ways, for example, as 136900 + 13315201 = 370^2 + 3649^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13452101 - 26 = 13452037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13452101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13452121) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 506 + ... + 5211.
It is an arithmetic number, because the mean of its divisors is an integer number (1821183).
Almost surely, 213452101 is an apocalyptic number.
It is an amenable number.
13452101 is a deficient number, since it is larger than the sum of its proper divisors (1117363).
13452101 is a wasteful number, since it uses less digits than its factorization.
13452101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5911.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 13452101 is about 3667.7105938173. The cubic root of 13452101 is about 237.8282132526.
Adding to 13452101 its reverse (10125431), we get a palindrome (23577532).
The spelling of 13452101 in words is "thirteen million, four hundred fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •