Base | Representation |
---|---|
bin | 110111111011010010… |
… | …1000010010110000001 |
3 | 102111000001021000100002 |
4 | 1233312211002112001 |
5 | 3431431330133212 |
6 | 131101301405345 |
7 | 11451133556303 |
oct | 1576645022601 |
9 | 374001230302 |
10 | 120101021057 |
11 | 46a309937a6 |
12 | 1b339709855 |
13 | b4300c7844 |
14 | 5b54921973 |
15 | 31cdcacac2 |
hex | 1bf6942581 |
120101021057 has 2 divisors, whose sum is σ = 120101021058. Its totient is φ = 120101021056.
The previous prime is 120101020951. The next prime is 120101021059. The reversal of 120101021057 is 750120101021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117824681536 + 2276339521 = 343256^2 + 47711^2 .
It is a cyclic number.
It is not a de Polignac number, because 120101021057 - 232 = 115806053761 is a prime.
Together with 120101021059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (120101021059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60050510528 + 60050510529.
It is an arithmetic number, because the mean of its divisors is an integer number (60050510529).
Almost surely, 2120101021057 is an apocalyptic number.
It is an amenable number.
120101021057 is a deficient number, since it is larger than the sum of its proper divisors (1).
120101021057 is an equidigital number, since it uses as much as digits as its factorization.
120101021057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 140, while the sum is 20.
Adding to 120101021057 its reverse (750120101021), we get a palindrome (870221122078).
The spelling of 120101021057 in words is "one hundred twenty billion, one hundred one million, twenty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •