Base | Representation |
---|---|
bin | 11011010101011110011111… |
… | …111101001111000011011011 |
3 | 120202200012212110122112212022 |
4 | 123111132133331033003123 |
5 | 111224213413440241443 |
6 | 1103405422531205055 |
7 | 34215555551201225 |
oct | 3325363775170333 |
9 | 522605773575768 |
10 | 120223113212123 |
11 | 3534137721a809 |
12 | 1159806544678b |
13 | 5210cb60c640c |
14 | 2198b88aad415 |
15 | dd742bcede68 |
hex | 6d579ff4f0db |
120223113212123 has 2 divisors, whose sum is σ = 120223113212124. Its totient is φ = 120223113212122.
The previous prime is 120223113212117. The next prime is 120223113212131. The reversal of 120223113212123 is 321212311322021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120223113212123 - 222 = 120223109017819 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120223113212092 and 120223113212101.
It is not a weakly prime, because it can be changed into another prime (120223113212143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60111556606061 + 60111556606062.
It is an arithmetic number, because the mean of its divisors is an integer number (60111556606062).
Almost surely, 2120223113212123 is an apocalyptic number.
120223113212123 is a deficient number, since it is larger than the sum of its proper divisors (1).
120223113212123 is an equidigital number, since it uses as much as digits as its factorization.
120223113212123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 120223113212123 its reverse (321212311322021), we get a palindrome (441435424534144).
The spelling of 120223113212123 in words is "one hundred twenty trillion, two hundred twenty-three billion, one hundred thirteen million, two hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •