Base | Representation |
---|---|
bin | 110001110100… |
… | …100100011001 |
3 | 220120112110200 |
4 | 301310210121 |
5 | 11320413002 |
6 | 1143532413 |
7 | 216003621 |
oct | 61644431 |
9 | 26515420 |
10 | 13060377 |
11 | 7410500 |
12 | 445a109 |
13 | 2923845 |
14 | 1a3d881 |
15 | 122eb1c |
hex | c74919 |
13060377 has 36 divisors (see below), whose sum is σ = 21162960. Its totient is φ = 7753680.
The previous prime is 13060373. The next prime is 13060381. The reversal of 13060377 is 77306031.
13060377 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13060373) and next prime (13060381).
It is not a de Polignac number, because 13060377 - 22 = 13060373 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13060377.
It is not an unprimeable number, because it can be changed into a prime (13060373) 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 35 ways as a sum of consecutive naturals, for example, 72874 + ... + 73052.
It is an arithmetic number, because the mean of its divisors is an integer number (587860).
Almost surely, 213060377 is an apocalyptic number.
It is an amenable number.
13060377 is a deficient number, since it is larger than the sum of its proper divisors (8102583).
13060377 is a wasteful number, since it uses less digits than its factorization.
13060377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274 (or 260 counting only the distinct ones).
The product of its (nonzero) digits is 2646, while the sum is 27.
The square root of 13060377 is about 3613.9143598043. The cubic root of 13060377 is about 235.4969234320.
The spelling of 13060377 in words is "thirteen million, sixty thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •