Base | Representation |
---|---|
bin | 11011010101011101101010… |
… | …110110011000001101110101 |
3 | 120202200010120101002120110102 |
4 | 123111131222312120031311 |
5 | 111224210102342102242 |
6 | 1103405154302203445 |
7 | 34215524512000034 |
oct | 3325355266301565 |
9 | 522603511076412 |
10 | 120222222222197 |
11 | 35340a5a2918a7 |
12 | 11597a56b83585 |
13 | 5210ba3635b44 |
14 | 2198b0261a71b |
15 | dd73c89a1e32 |
hex | 6d576ad98375 |
120222222222197 has 2 divisors, whose sum is σ = 120222222222198. Its totient is φ = 120222222222196.
The previous prime is 120222222222031. The next prime is 120222222222253. The reversal of 120222222222197 is 791222222222021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75379190330161 + 44843031892036 = 8682119^2 + 6696494^2 .
It is a cyclic number.
It is not a de Polignac number, because 120222222222197 - 216 = 120222222156661 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120222222222197.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120221222222197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60111111111098 + 60111111111099.
It is an arithmetic number, because the mean of its divisors is an integer number (60111111111099).
Almost surely, 2120222222222197 is an apocalyptic number.
It is an amenable number.
120222222222197 is a deficient number, since it is larger than the sum of its proper divisors (1).
120222222222197 is an equidigital number, since it uses as much as digits as its factorization.
120222222222197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 38.
The spelling of 120222222222197 in words is "one hundred twenty trillion, two hundred twenty-two billion, two hundred twenty-two million, two hundred twenty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •