Base | Representation |
---|---|
bin | 11011010101011110100000… |
… | …111101100110111000101101 |
3 | 120202200012220122101212210011 |
4 | 123111132200331212320231 |
5 | 111224213432300240312 |
6 | 1103405424333013221 |
7 | 34215556144503052 |
oct | 3325364075467055 |
9 | 522605818355704 |
10 | 120223130086957 |
11 | 353413857a6057 |
12 | 1159806b024211 |
13 | 5210cb9754221 |
14 | 2198b8b023029 |
15 | dd742d533da7 |
hex | 6d57a0f66e2d |
120223130086957 has 2 divisors, whose sum is σ = 120223130086958. Its totient is φ = 120223130086956.
The previous prime is 120223130086937. The next prime is 120223130086979. The reversal of 120223130086957 is 759680031322021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107575355397316 + 12647774689641 = 10371854^2 + 3556371^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120223130086957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120223130086957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120223130086937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60111565043478 + 60111565043479.
It is an arithmetic number, because the mean of its divisors is an integer number (60111565043479).
Almost surely, 2120223130086957 is an apocalyptic number.
It is an amenable number.
120223130086957 is a deficient number, since it is larger than the sum of its proper divisors (1).
120223130086957 is an equidigital number, since it uses as much as digits as its factorization.
120223130086957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 49.
The spelling of 120223130086957 in words is "one hundred twenty trillion, two hundred twenty-three billion, one hundred thirty million, eighty-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •