Base | Representation |
---|---|
bin | 111000111001110111… |
… | …1110111101110001101 |
3 | 102200102101202122220101 |
4 | 1301303233313232031 |
5 | 4000231424410013 |
6 | 132045515451101 |
7 | 11554153321213 |
oct | 1616357675615 |
9 | 380371678811 |
10 | 122201013133 |
11 | 47909316941 |
12 | 1b824a56a91 |
13 | b6a61b1bc4 |
14 | 5cb37a8cb3 |
15 | 32a33228dd |
hex | 1c73bf7b8d |
122201013133 has 2 divisors, whose sum is σ = 122201013134. Its totient is φ = 122201013132.
The previous prime is 122201013127. The next prime is 122201013163. The reversal of 122201013133 is 331310102221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71189176969 + 51011836164 = 266813^2 + 225858^2 .
It is a cyclic number.
It is not a de Polignac number, because 122201013133 - 225 = 122167458701 is a prime.
It is a super-2 number, since 2×1222010131332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122201013133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122201013163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61100506566 + 61100506567.
It is an arithmetic number, because the mean of its divisors is an integer number (61100506567).
Almost surely, 2122201013133 is an apocalyptic number.
It is an amenable number.
122201013133 is a deficient number, since it is larger than the sum of its proper divisors (1).
122201013133 is an equidigital number, since it uses as much as digits as its factorization.
122201013133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 122201013133 its reverse (331310102221), we get a palindrome (453511115354).
The spelling of 122201013133 in words is "one hundred twenty-two billion, two hundred one million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •