Base | Representation |
---|---|
bin | 110100100011001000001000… |
… | …100001100000001100110101 |
3 | 1010022022010022212110222001022 |
4 | 310203020020201200030311 |
5 | 220243021024244320013 |
6 | 2135311312401310525 |
7 | 66452213031133322 |
oct | 6443101041401465 |
9 | 1108263285428038 |
10 | 231112333198133 |
11 | 67704210005722 |
12 | 21b07150935445 |
13 | 9bc5a5169056a |
14 | 410dc7a42bb49 |
15 | 1babb67455008 |
hex | d23208860335 |
231112333198133 has 2 divisors, whose sum is σ = 231112333198134. Its totient is φ = 231112333198132.
The previous prime is 231112333198111. The next prime is 231112333198157. The reversal of 231112333198133 is 331891333211132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 224852364226084 + 6259968972049 = 14995078^2 + 2501993^2 .
It is a cyclic number.
It is not a de Polignac number, because 231112333198133 - 26 = 231112333198069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231112333198193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115556166599066 + 115556166599067.
It is an arithmetic number, because the mean of its divisors is an integer number (115556166599067).
Almost surely, 2231112333198133 is an apocalyptic number.
It is an amenable number.
231112333198133 is a deficient number, since it is larger than the sum of its proper divisors (1).
231112333198133 is an equidigital number, since it uses as much as digits as its factorization.
231112333198133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 209952, while the sum is 44.
The spelling of 231112333198133 in words is "two hundred thirty-one trillion, one hundred twelve billion, three hundred thirty-three million, one hundred ninety-eight thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •