Base | Representation |
---|---|
bin | 110001110100… |
… | …111110000001 |
3 | 220120121201102 |
4 | 301310332001 |
5 | 11320441032 |
6 | 1143544145 |
7 | 216011453 |
oct | 61647601 |
9 | 26517642 |
10 | 13062017 |
11 | 7411761 |
12 | 445b055 |
13 | 2924507 |
14 | 1a402d3 |
15 | 1230362 |
hex | c74f81 |
13062017 has 2 divisors, whose sum is σ = 13062018. Its totient is φ = 13062016.
The previous prime is 13061957. The next prime is 13062029. The reversal of 13062017 is 71026031.
It is a happy number.
13062017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9709456 + 3352561 = 3116^2 + 1831^2 .
It is an emirp because it is prime and its reverse (71026031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13062017 - 28 = 13061761 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13062017.
It is not a weakly prime, because it can be changed into another prime (13062037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6531008 + 6531009.
It is an arithmetic number, because the mean of its divisors is an integer number (6531009).
Almost surely, 213062017 is an apocalyptic number.
It is an amenable number.
13062017 is a deficient number, since it is larger than the sum of its proper divisors (1).
13062017 is an equidigital number, since it uses as much as digits as its factorization.
13062017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 20.
The square root of 13062017 is about 3614.1412534653. The cubic root of 13062017 is about 235.5067801865.
Adding to 13062017 its reverse (71026031), we get a palindrome (84088048).
The spelling of 13062017 in words is "thirteen million, sixty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •