Base | Representation |
---|---|
bin | 10111111100000111010001… |
… | …00100110100100101111101 |
3 | 20220101121211122201211222012 |
4 | 23332003220210310211331 |
5 | 23400000401403141433 |
6 | 303543511533101005 |
7 | 14042222065453241 |
oct | 1376035044644575 |
9 | 226347748654865 |
10 | 52643021146493 |
11 | 15856864044598 |
12 | 5aa26a1327765 |
13 | 234b2a587383b |
14 | cddd15c58421 |
15 | 614574811848 |
hex | 2fe0e893497d |
52643021146493 has 2 divisors, whose sum is σ = 52643021146494. Its totient is φ = 52643021146492.
The previous prime is 52643021146439. The next prime is 52643021146523. The reversal of 52643021146493 is 39464112034625.
Together with previous prime (52643021146439) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40544011986724 + 12099009159769 = 6367418^2 + 3478363^2 .
It is a cyclic number.
It is not a de Polignac number, because 52643021146493 - 210 = 52643021145469 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 (52643021136493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26321510573246 + 26321510573247.
It is an arithmetic number, because the mean of its divisors is an integer number (26321510573247).
Almost surely, 252643021146493 is an apocalyptic number.
It is an amenable number.
52643021146493 is a deficient number, since it is larger than the sum of its proper divisors (1).
52643021146493 is an equidigital number, since it uses as much as digits as its factorization.
52643021146493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 50.
The spelling of 52643021146493 in words is "fifty-two trillion, six hundred forty-three billion, twenty-one million, one hundred forty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •