Base | Representation |
---|---|
bin | 110001101101… |
… | …010010001101 |
3 | 220112000112122 |
4 | 301231102031 |
5 | 11313434131 |
6 | 1143142325 |
7 | 215520626 |
oct | 61552215 |
9 | 26460478 |
10 | 13030541 |
11 | 73a0047 |
12 | 44449a5 |
13 | 29130a4 |
14 | 1a32a4d |
15 | 1225d7b |
hex | c6d48d |
13030541 has 8 divisors (see below), whose sum is σ = 13520280. Its totient is φ = 12543552.
The previous prime is 13030513. The next prime is 13030543. The reversal of 13030541 is 14503031.
13030541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1612900 + 11417641 = 1270^2 + 3379^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13030541 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13030543) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17411 + ... + 18143.
It is an arithmetic number, because the mean of its divisors is an integer number (1690035).
Almost surely, 213030541 is an apocalyptic number.
It is an amenable number.
13030541 is a deficient number, since it is larger than the sum of its proper divisors (489739).
13030541 is an equidigital number, since it uses as much as digits as its factorization.
13030541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1375.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 13030541 is about 3609.7840655640. The cubic root of 13030541 is about 235.3174583868.
Adding to 13030541 its reverse (14503031), we get a palindrome (27533572).
The spelling of 13030541 in words is "thirteen million, thirty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •