Base | Representation |
---|---|
bin | 11011110010111010000001… |
… | …001000000001010101001101 |
3 | 121000211120001212020201212022 |
4 | 123302322001020001111031 |
5 | 112010332314014322341 |
6 | 1111554452534215525 |
7 | 34514643040312454 |
oct | 3362720110012515 |
9 | 530746055221768 |
10 | 122245525542221 |
11 | 35a51044263954 |
12 | 118640031b45a5 |
13 | 532991ba4a373 |
14 | 2228a01d93b9b |
15 | e1ed47706e4b |
hex | 6f2e8120154d |
122245525542221 has 2 divisors, whose sum is σ = 122245525542222. Its totient is φ = 122245525542220.
The previous prime is 122245525542181. The next prime is 122245525542227.
122245525542221 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78581381368996 + 43664144173225 = 8864614^2 + 6607885^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 122245525542221 - 230 = 122244451800397 is a prime.
It is a super-2 number, since 2×1222455255422212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122245525542227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61122762771110 + 61122762771111.
It is an arithmetic number, because the mean of its divisors is an integer number (61122762771111).
Almost surely, 2122245525542221 is an apocalyptic number.
It is an amenable number.
122245525542221 is a deficient number, since it is larger than the sum of its proper divisors (1).
122245525542221 is an equidigital number, since it uses as much as digits as its factorization.
122245525542221 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1280000, while the sum is 44.
The spelling of 122245525542221 in words is "one hundred twenty-two trillion, two hundred forty-five billion, five hundred twenty-five million, five hundred forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.996 sec. • engine limits •