Base | Representation |
---|---|
bin | 10111110000100000101010… |
… | …11101001001110010010001 |
3 | 20211222111210000212112022202 |
4 | 23320100111131021302101 |
5 | 23321432403042333322 |
6 | 303040415222412545 |
7 | 14001346334101226 |
oct | 1370202535116221 |
9 | 224874700775282 |
10 | 52244342152337 |
11 | 15712779157465 |
12 | 5a39378591155 |
13 | 231c80ab1667a |
14 | cc88d52c394d |
15 | 608eddda7292 |
hex | 2f8415749c91 |
52244342152337 has 2 divisors, whose sum is σ = 52244342152338. Its totient is φ = 52244342152336.
The previous prime is 52244342152319. The next prime is 52244342152339. The reversal of 52244342152337 is 73325124344225.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48421988705281 + 3822353447056 = 6958591^2 + 1955084^2 .
It is a cyclic number.
It is not a de Polignac number, because 52244342152337 - 232 = 52240047185041 is a prime.
Together with 52244342152339, 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 = 52244342152291 and 52244342152300.
It is not a weakly prime, because it can be changed into another prime (52244342152339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26122171076168 + 26122171076169.
It is an arithmetic number, because the mean of its divisors is an integer number (26122171076169).
Almost surely, 252244342152337 is an apocalyptic number.
It is an amenable number.
52244342152337 is a deficient number, since it is larger than the sum of its proper divisors (1).
52244342152337 is an equidigital number, since it uses as much as digits as its factorization.
52244342152337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4838400, while the sum is 47.
The spelling of 52244342152337 in words is "fifty-two trillion, two hundred forty-four billion, three hundred forty-two million, one hundred fifty-two thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •