Base | Representation |
---|---|
bin | 11101110111001100001… |
… | …100001010110110100101 |
3 | 21021011220010111102222002 |
4 | 131313030030022312211 |
5 | 232110223014024222 |
6 | 4210422215415045 |
7 | 301155400622246 |
oct | 35671414126645 |
9 | 7234803442862 |
10 | 2052125142437 |
11 | 7213351648a7 |
12 | 291870684485 |
13 | 11b68c685c16 |
14 | 71475532ccd |
15 | 385a9204392 |
hex | 1ddcc30ada5 |
2052125142437 has 2 divisors, whose sum is σ = 2052125142438. Its totient is φ = 2052125142436.
The previous prime is 2052125142383. The next prime is 2052125142467. The reversal of 2052125142437 is 7342415212502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1654410765121 + 397714377316 = 1286239^2 + 630646^2 .
It is a cyclic number.
It is not a de Polignac number, because 2052125142437 - 28 = 2052125142181 is a prime.
It is a super-2 number, since 2×20521251424372 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2052125142437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2052125142467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1026062571218 + 1026062571219.
It is an arithmetic number, because the mean of its divisors is an integer number (1026062571219).
Almost surely, 22052125142437 is an apocalyptic number.
It is an amenable number.
2052125142437 is a deficient number, since it is larger than the sum of its proper divisors (1).
2052125142437 is an equidigital number, since it uses as much as digits as its factorization.
2052125142437 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 134400, while the sum is 38.
The spelling of 2052125142437 in words is "two trillion, fifty-two billion, one hundred twenty-five million, one hundred forty-two thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •