Base | Representation |
---|---|
bin | 111000001100000001… |
… | …1100010100000011001 |
3 | 102112110012002111022112 |
4 | 1300120003202200121 |
5 | 3434104120241431 |
6 | 131233123402105 |
7 | 11501063506016 |
oct | 1603003424031 |
9 | 375405074275 |
10 | 120662665241 |
11 | 47199a24348 |
12 | 1b475823335 |
13 | b4bc584091 |
14 | 5ba936270d |
15 | 3213250c2b |
hex | 1c180e2819 |
120662665241 has 2 divisors, whose sum is σ = 120662665242. Its totient is φ = 120662665240.
The previous prime is 120662665223. The next prime is 120662665243. The reversal of 120662665241 is 142566266021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68047939600 + 52614725641 = 260860^2 + 229379^2 .
It is an emirp because it is prime and its reverse (142566266021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120662665241 - 222 = 120658470937 is a prime.
It is a Sophie Germain prime.
Together with 120662665243, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (120662665243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60331332620 + 60331332621.
It is an arithmetic number, because the mean of its divisors is an integer number (60331332621).
Almost surely, 2120662665241 is an apocalyptic number.
It is an amenable number.
120662665241 is a deficient number, since it is larger than the sum of its proper divisors (1).
120662665241 is an equidigital number, since it uses as much as digits as its factorization.
120662665241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 120662665241 in words is "one hundred twenty billion, six hundred sixty-two million, six hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •