Base | Representation |
---|---|
bin | 111101001010001… |
… | …0011100011000001 |
3 | 12022000110200101022 |
4 | 1322110103203001 |
5 | 13200322041142 |
6 | 535344315225 |
7 | 101565634031 |
oct | 17224234301 |
9 | 5260420338 |
10 | 2052143297 |
11 | 9634216a6 |
12 | 493312b15 |
13 | 269203199 |
14 | 15678d8c1 |
15 | c02626d2 |
hex | 7a5138c1 |
2052143297 has 2 divisors, whose sum is σ = 2052143298. Its totient is φ = 2052143296.
The previous prime is 2052143293. The next prime is 2052143299. The reversal of 2052143297 is 7923412502.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1733556496 + 318586801 = 41636^2 + 17849^2 .
It is a cyclic number.
It is not a de Polignac number, because 2052143297 - 22 = 2052143293 is a prime.
It is a super-2 number, since 2×20521432972 = 8422584222844060418, which contains 22 as substring.
Together with 2052143299, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2052143293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1026071648 + 1026071649.
It is an arithmetic number, because the mean of its divisors is an integer number (1026071649).
Almost surely, 22052143297 is an apocalyptic number.
It is an amenable number.
2052143297 is a deficient number, since it is larger than the sum of its proper divisors (1).
2052143297 is an equidigital number, since it uses as much as digits as its factorization.
2052143297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30240, while the sum is 35.
The square root of 2052143297 is about 45300.5882632886. The cubic root of 2052143297 is about 1270.7766545495.
Adding to 2052143297 its reverse (7923412502), we get a palindrome (9975555799).
The spelling of 2052143297 in words is "two billion, fifty-two million, one hundred forty-three thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.041 sec. • engine limits •