Base | Representation |
---|---|
bin | 11011010100000000011011… |
… | …110000011101010001001101 |
3 | 120202022120011110012200102201 |
4 | 123110000123300131101031 |
5 | 111221040040410202112 |
6 | 1103251200323521501 |
7 | 34205351614561126 |
oct | 3324003360352115 |
9 | 522276143180381 |
10 | 120122111022157 |
11 | 35302557105542 |
12 | 11580577b29291 |
13 | 520460aa90a7a |
14 | 2193d268d104d |
15 | dd49b9aee257 |
hex | 6d401bc1d44d |
120122111022157 has 2 divisors, whose sum is σ = 120122111022158. Its totient is φ = 120122111022156.
The previous prime is 120122111022073. The next prime is 120122111022283. The reversal of 120122111022157 is 751220111221021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119847011821156 + 275099201001 = 10947466^2 + 524499^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120122111022157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120122151022157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60061055511078 + 60061055511079.
It is an arithmetic number, because the mean of its divisors is an integer number (60061055511079).
Almost surely, 2120122111022157 is an apocalyptic number.
It is an amenable number.
120122111022157 is a deficient number, since it is larger than the sum of its proper divisors (1).
120122111022157 is an equidigital number, since it uses as much as digits as its factorization.
120122111022157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 28.
Adding to 120122111022157 its reverse (751220111221021), we get a palindrome (871342222243178).
The spelling of 120122111022157 in words is "one hundred twenty trillion, one hundred twenty-two billion, one hundred eleven million, twenty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •