Base | Representation |
---|---|
bin | 111101111000101001111… |
… | …111001100111110110001 |
3 | 120001120000111211101110102 |
4 | 331320221333030332301 |
5 | 1024134033321312022 |
6 | 13013401252442145 |
7 | 616151263023401 |
oct | 75705177147661 |
9 | 16046014741412 |
10 | 4252722057137 |
11 | 139a629807714 |
12 | 588258019355 |
13 | 24b050ac4908 |
14 | 109b93486801 |
15 | 75952c64a92 |
hex | 3de29fccfb1 |
4252722057137 has 2 divisors, whose sum is σ = 4252722057138. Its totient is φ = 4252722057136.
The previous prime is 4252722057109. The next prime is 4252722057139. The reversal of 4252722057137 is 7317502272524.
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., 2428037102656 + 1824684954481 = 1558216^2 + 1350809^2 .
It is a cyclic number.
It is not a de Polignac number, because 4252722057137 - 226 = 4252654948273 is a prime.
Together with 4252722057139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4252722057091 and 4252722057100.
It is not a weakly prime, because it can be changed into another prime (4252722057139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2126361028568 + 2126361028569.
It is an arithmetic number, because the mean of its divisors is an integer number (2126361028569).
Almost surely, 24252722057137 is an apocalyptic number.
It is an amenable number.
4252722057137 is a deficient number, since it is larger than the sum of its proper divisors (1).
4252722057137 is an equidigital number, since it uses as much as digits as its factorization.
4252722057137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1646400, while the sum is 47.
The spelling of 4252722057137 in words is "four trillion, two hundred fifty-two billion, seven hundred twenty-two million, fifty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •