Base | Representation |
---|---|
bin | 11011010011110101010000… |
… | …100011111001111011010111 |
3 | 120202021102012012222022221001 |
4 | 123103311100203321323113 |
5 | 111220341002134202411 |
6 | 1103241453531404131 |
7 | 34204445355011062 |
oct | 3323652043717327 |
9 | 522242165868831 |
10 | 120110112022231 |
11 | 352a8459a77281 |
12 | 1157a1895b3647 |
13 | 5203447bb9506 |
14 | 21935090938d9 |
15 | dd45164c9dc1 |
hex | 6d3d508f9ed7 |
120110112022231 has 2 divisors, whose sum is σ = 120110112022232. Its totient is φ = 120110112022230.
The previous prime is 120110112022189. The next prime is 120110112022237. The reversal of 120110112022231 is 132220211011021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120110112022231 - 245 = 84925739933399 is a prime.
It is a super-2 number, since 2×1201101120222312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120110112022199 and 120110112022208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120110112022237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60055056011115 + 60055056011116.
It is an arithmetic number, because the mean of its divisors is an integer number (60055056011116).
Almost surely, 2120110112022231 is an apocalyptic number.
120110112022231 is a deficient number, since it is larger than the sum of its proper divisors (1).
120110112022231 is an equidigital number, since it uses as much as digits as its factorization.
120110112022231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 120110112022231 its reverse (132220211011021), we get a palindrome (252330323033252).
The spelling of 120110112022231 in words is "one hundred twenty trillion, one hundred ten billion, one hundred twelve million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •