Base | Representation |
---|---|
bin | 110001111111… |
… | …011110100101 |
3 | 220122210202122 |
4 | 301333132211 |
5 | 11323330221 |
6 | 1144515325 |
7 | 216251114 |
oct | 61773645 |
9 | 26583678 |
10 | 13105061 |
11 | 7441032 |
12 | 447bb45 |
13 | 293ac98 |
14 | 1a51c7b |
15 | 123ceab |
hex | c7f7a5 |
13105061 has 4 divisors (see below), whose sum is σ = 13113324. Its totient is φ = 13096800.
The previous prime is 13105051. The next prime is 13105091. The reversal of 13105061 is 16050131.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 16050131 = 149 ⋅107719.
It can be written as a sum of positive squares in 2 ways, for example, as 7392961 + 5712100 = 2719^2 + 2390^2 .
It is a cyclic number.
It is not a de Polignac number, because 13105061 - 210 = 13104037 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 (13105051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 920 + ... + 5201.
It is an arithmetic number, because the mean of its divisors is an integer number (3278331).
Almost surely, 213105061 is an apocalyptic number.
It is an amenable number.
13105061 is a deficient number, since it is larger than the sum of its proper divisors (8263).
13105061 is an equidigital number, since it uses as much as digits as its factorization.
13105061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8262.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 13105061 is about 3620.0912971913. The cubic root of 13105061 is about 235.7651894610.
Adding to 13105061 its reverse (16050131), we get a palindrome (29155192).
The spelling of 13105061 in words is "thirteen million, one hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •