Base | Representation |
---|---|
bin | 110001110011… |
… | …101111111101 |
3 | 220120100212101 |
4 | 301303233331 |
5 | 11320311041 |
6 | 1143505101 |
7 | 215661055 |
oct | 61635775 |
9 | 26510771 |
10 | 13057021 |
11 | 7408a2a |
12 | 4458191 |
13 | 2922163 |
14 | 1a3c565 |
15 | 122db31 |
hex | c73bfd |
13057021 has 2 divisors, whose sum is σ = 13057022. Its totient is φ = 13057020.
The previous prime is 13057013. The next prime is 13057039. The reversal of 13057021 is 12075031.
13057021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12888100 + 168921 = 3590^2 + 411^2 .
It is an emirp because it is prime and its reverse (12075031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13057021 - 23 = 13057013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13057021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13057081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6528510 + 6528511.
It is an arithmetic number, because the mean of its divisors is an integer number (6528511).
Almost surely, 213057021 is an apocalyptic number.
It is an amenable number.
13057021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13057021 is an equidigital number, since it uses as much as digits as its factorization.
13057021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 210, while the sum is 19.
The square root of 13057021 is about 3613.4500134913. The cubic root of 13057021 is about 235.4767505744.
The spelling of 13057021 in words is "thirteen million, fifty-seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •