Base | Representation |
---|---|
bin | 10111101100101100110011… |
… | …11001010101011111111001 |
3 | 20211111222211212000112201022 |
4 | 23312112121321111133321 |
5 | 23312311241024143211 |
6 | 302500324045432225 |
7 | 13656033063313565 |
oct | 1366263171253771 |
9 | 224458755015638 |
10 | 52113420146681 |
11 | 156721a5095893 |
12 | 5a17b1ab6b675 |
13 | 2310374c1217a |
14 | cc24355b06a5 |
15 | 6058ca11bbdb |
hex | 2f6599e557f9 |
52113420146681 has 2 divisors, whose sum is σ = 52113420146682. Its totient is φ = 52113420146680.
The previous prime is 52113420146611. The next prime is 52113420146687. The reversal of 52113420146681 is 18664102431125.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36095343043600 + 16018077103081 = 6007940^2 + 4002259^2 .
It is a cyclic number.
It is not a de Polignac number, because 52113420146681 - 242 = 47715373635577 is a prime.
It is a super-2 number, since 2×521134201466812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (52113420146687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26056710073340 + 26056710073341.
It is an arithmetic number, because the mean of its divisors is an integer number (26056710073341).
Almost surely, 252113420146681 is an apocalyptic number.
It is an amenable number.
52113420146681 is a deficient number, since it is larger than the sum of its proper divisors (1).
52113420146681 is an equidigital number, since it uses as much as digits as its factorization.
52113420146681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 276480, while the sum is 44.
The spelling of 52113420146681 in words is "fifty-two trillion, one hundred thirteen billion, four hundred twenty million, one hundred forty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •