Base | Representation |
---|---|
bin | 11001000010011101011101… |
… | …011000100100000001010111 |
3 | 112102220101120101120022100221 |
4 | 121002131131120210001113 |
5 | 103413202214201102411 |
6 | 1030112311535015211 |
7 | 32123632015165261 |
oct | 3102353530440127 |
9 | 472811511508327 |
10 | 110120233222231 |
11 | 320a6801909661 |
12 | 1042605736a507 |
13 | 495a3a78a563b |
14 | 1d29bc2236b31 |
15 | cae72edd6071 |
hex | 64275d624057 |
110120233222231 has 2 divisors, whose sum is σ = 110120233222232. Its totient is φ = 110120233222230.
The previous prime is 110120233222201. The next prime is 110120233222343. The reversal of 110120233222231 is 132222332021011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110120233222231 - 211 = 110120233220183 is a prime.
It is a super-2 number, since 2×1101202332222312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110120233222196 and 110120233222205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110120233222201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060116611115 + 55060116611116.
It is an arithmetic number, because the mean of its divisors is an integer number (55060116611116).
Almost surely, 2110120233222231 is an apocalyptic number.
110120233222231 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120233222231 is an equidigital number, since it uses as much as digits as its factorization.
110120233222231 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 25.
Adding to 110120233222231 its reverse (132222332021011), we get a palindrome (242342565243242).
The spelling of 110120233222231 in words is "one hundred ten trillion, one hundred twenty billion, two hundred thirty-three million, two hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •