Base | Representation |
---|---|
bin | 10111101100111101000001… |
… | …00000111011100011000001 |
3 | 20211112211022020102222202202 |
4 | 23312132200200323203001 |
5 | 23312432101001432113 |
6 | 302504323305522545 |
7 | 13656461515355522 |
oct | 1366364040734301 |
9 | 224484266388682 |
10 | 52122121124033 |
11 | 1567595a60a964 |
12 | 5a19748aa3455 |
13 | 231113074748c |
14 | cc2a1cdc8849 |
15 | 605c38e2e258 |
hex | 2f67a083b8c1 |
52122121124033 has 2 divisors, whose sum is σ = 52122121124034. Its totient is φ = 52122121124032.
The previous prime is 52122121123981. The next prime is 52122121124057. The reversal of 52122121124033 is 33042112122125.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34477013554369 + 17645107569664 = 5871713^2 + 4200608^2 .
It is a cyclic number.
It is not a de Polignac number, because 52122121124033 - 214 = 52122121107649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52122121123987 and 52122121124005.
It is not a weakly prime, because it can be changed into another prime (52122121124083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26061060562016 + 26061060562017.
It is an arithmetic number, because the mean of its divisors is an integer number (26061060562017).
Almost surely, 252122121124033 is an apocalyptic number.
It is an amenable number.
52122121124033 is a deficient number, since it is larger than the sum of its proper divisors (1).
52122121124033 is an equidigital number, since it uses as much as digits as its factorization.
52122121124033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 52122121124033 its reverse (33042112122125), we get a palindrome (85164233246158).
The spelling of 52122121124033 in words is "fifty-two trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •