Base | Representation |
---|---|
bin | 111011001010011111… |
… | …0101111000010000001 |
3 | 110010221120121210221121 |
4 | 1312110332233002001 |
5 | 4040201200300441 |
6 | 134211221552241 |
7 | 12115335100405 |
oct | 1662476570201 |
9 | 403846553847 |
10 | 127053525121 |
11 | 49979447a26 |
12 | 20759b75681 |
13 | bc9a611083 |
14 | 6214037105 |
15 | 3489343dd1 |
hex | 1d94faf081 |
127053525121 has 2 divisors, whose sum is σ = 127053525122. Its totient is φ = 127053525120.
The previous prime is 127053525113. The next prime is 127053525143. The reversal of 127053525121 is 121525350721.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116161680625 + 10891844496 = 340825^2 + 104364^2 .
It is a cyclic number.
It is not a de Polignac number, because 127053525121 - 23 = 127053525113 is a prime.
It is a super-2 number, since 2×1270535251212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (127053522121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63526762560 + 63526762561.
It is an arithmetic number, because the mean of its divisors is an integer number (63526762561).
Almost surely, 2127053525121 is an apocalyptic number.
It is an amenable number.
127053525121 is a deficient number, since it is larger than the sum of its proper divisors (1).
127053525121 is an equidigital number, since it uses as much as digits as its factorization.
127053525121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 34.
Adding to 127053525121 its reverse (121525350721), we get a palindrome (248578875842).
The spelling of 127053525121 in words is "one hundred twenty-seven billion, fifty-three million, five hundred twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •