Base | Representation |
---|---|
bin | 10111101100111101000001… |
… | …00001000100101101010001 |
3 | 20211112211022020111220020101 |
4 | 23312132200201010231101 |
5 | 23312432101004132203 |
6 | 302504323310412401 |
7 | 13656461515603102 |
oct | 1366364041045521 |
9 | 224484266456211 |
10 | 52122121161553 |
11 | 1567595a636073 |
12 | 5a19748b01101 |
13 | 231113075b591 |
14 | cc2a1cdd83a9 |
15 | 605c38e3a41d |
hex | 2f67a0844b51 |
52122121161553 has 2 divisors, whose sum is σ = 52122121161554. Its totient is φ = 52122121161552.
The previous prime is 52122121161529. The next prime is 52122121161571. The reversal of 52122121161553 is 35516112122125.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43202383413904 + 8919737747649 = 6572852^2 + 2986593^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52122121161553 is a prime.
It is a super-2 number, since 2×521221211615532 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (52122121161953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26061060580776 + 26061060580777.
It is an arithmetic number, because the mean of its divisors is an integer number (26061060580777).
Almost surely, 252122121161553 is an apocalyptic number.
It is an amenable number.
52122121161553 is a deficient number, since it is larger than the sum of its proper divisors (1).
52122121161553 is an equidigital number, since it uses as much as digits as its factorization.
52122121161553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36000, while the sum is 37.
Adding to 52122121161553 its reverse (35516112122125), we get a palindrome (87638233283678).
The spelling of 52122121161553 in words is "fifty-two trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred sixty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •