Base | Representation |
---|---|
bin | 1001100100110111… |
… | …0110011101110101 |
3 | 20122010221012211212 |
4 | 2121031312131311 |
5 | 20231024420023 |
6 | 1103023411205 |
7 | 120462162221 |
oct | 23115663565 |
9 | 6563835755 |
10 | 2570545013 |
11 | 10aa007573 |
12 | 5b8a53b05 |
13 | 31c72c06a |
14 | 1a5575781 |
15 | 100a12e78 |
hex | 99376775 |
2570545013 has 2 divisors, whose sum is σ = 2570545014. Its totient is φ = 2570545012.
The previous prime is 2570544973. The next prime is 2570545037. The reversal of 2570545013 is 3105450752.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1909952209 + 660592804 = 43703^2 + 25702^2 .
It is a cyclic number.
It is not a de Polignac number, because 2570545013 - 216 = 2570479477 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2570545613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1285272506 + 1285272507.
It is an arithmetic number, because the mean of its divisors is an integer number (1285272507).
Almost surely, 22570545013 is an apocalyptic number.
It is an amenable number.
2570545013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2570545013 is an equidigital number, since it uses as much as digits as its factorization.
2570545013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 32.
The square root of 2570545013 is about 50700.5425316140. The cubic root of 2570545013 is about 1369.8564882439.
Adding to 2570545013 its reverse (3105450752), we get a palindrome (5675995765).
The spelling of 2570545013 in words is "two billion, five hundred seventy million, five hundred forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •