Base | Representation |
---|---|
bin | 10111111100000111100001… |
… | …11111101111100100100101 |
3 | 20220101122012111120100220101 |
4 | 23332003300333233210211 |
5 | 23400001144034442131 |
6 | 303543533541104101 |
7 | 14042225432333656 |
oct | 1376036077574445 |
9 | 226348174510811 |
10 | 52643162421541 |
11 | 1585692686762a |
12 | 5aa27206b8031 |
13 | 234b2c8c09343 |
14 | cddd2a91152d |
15 | 614581e1ac61 |
hex | 2fe0f0fef925 |
52643162421541 has 2 divisors, whose sum is σ = 52643162421542. Its totient is φ = 52643162421540.
The previous prime is 52643162421539. The next prime is 52643162421559. The reversal of 52643162421541 is 14512426134625.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51140319352516 + 1502843069025 = 7151246^2 + 1225905^2 .
It is a cyclic number.
It is not a de Polignac number, because 52643162421541 - 21 = 52643162421539 is a prime.
Together with 52643162421539, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 52643162421491 and 52643162421500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52643162421511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26321581210770 + 26321581210771.
It is an arithmetic number, because the mean of its divisors is an integer number (26321581210771).
Almost surely, 252643162421541 is an apocalyptic number.
It is an amenable number.
52643162421541 is a deficient number, since it is larger than the sum of its proper divisors (1).
52643162421541 is an equidigital number, since it uses as much as digits as its factorization.
52643162421541 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1382400, while the sum is 46.
The spelling of 52643162421541 in words is "fifty-two trillion, six hundred forty-three billion, one hundred sixty-two million, four hundred twenty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •