Base | Representation |
---|---|
bin | 11011101111101011000011… |
… | …100101010111000001110011 |
3 | 121000001022110201212211021221 |
4 | 123233223003211113001303 |
5 | 111443212210332331011 |
6 | 1111304421533325511 |
7 | 34462615116320221 |
oct | 3357530345270163 |
9 | 530038421784257 |
10 | 122023302230131 |
11 | 35975878a71425 |
12 | 11828b25036897 |
13 | 531199554c0a3 |
14 | 221bd60601b11 |
15 | e1918d242971 |
hex | 6efac3957073 |
122023302230131 has 2 divisors, whose sum is σ = 122023302230132. Its totient is φ = 122023302230130.
The previous prime is 122023302230021. The next prime is 122023302230143. The reversal of 122023302230131 is 131032203320221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122023302230131 - 213 = 122023302221939 is a prime.
It is a super-2 number, since 2×1220233022301312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122023302230096 and 122023302230105.
It is not a weakly prime, because it can be changed into another prime (122023302200131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61011651115065 + 61011651115066.
It is an arithmetic number, because the mean of its divisors is an integer number (61011651115066).
Almost surely, 2122023302230131 is an apocalyptic number.
122023302230131 is a deficient number, since it is larger than the sum of its proper divisors (1).
122023302230131 is an equidigital number, since it uses as much as digits as its factorization.
122023302230131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 122023302230131 its reverse (131032203320221), we get a palindrome (253055505550352).
The spelling of 122023302230131 in words is "one hundred twenty-two trillion, twenty-three billion, three hundred two million, two hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •