Base | Representation |
---|---|
bin | 110100100011011000101100… |
… | …110101010010010100000101 |
3 | 1010022100211020121200120102222 |
4 | 310203120230311102110011 |
5 | 220243313442242424333 |
6 | 2135323413510142125 |
7 | 66453412615342106 |
oct | 6443305465222405 |
9 | 1108324217616388 |
10 | 231130122233093 |
11 | 677108094a5a06 |
12 | 21b0a696351945 |
13 | 9bc7627c97955 |
14 | 4110a86c203ad |
15 | 1bac35903a298 |
hex | d2362cd52505 |
231130122233093 has 2 divisors, whose sum is σ = 231130122233094. Its totient is φ = 231130122233092.
The previous prime is 231130122233077. The next prime is 231130122233137. The reversal of 231130122233093 is 390332221031132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 186129866415364 + 45000255817729 = 13642942^2 + 6708223^2 .
It is a cyclic number.
It is not a de Polignac number, because 231130122233093 - 24 = 231130122233077 is a prime.
It is a super-2 number, since 2×2311301222330932 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231130122223093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115565061116546 + 115565061116547.
It is an arithmetic number, because the mean of its divisors is an integer number (115565061116547).
Almost surely, 2231130122233093 is an apocalyptic number.
It is an amenable number.
231130122233093 is a deficient number, since it is larger than the sum of its proper divisors (1).
231130122233093 is an equidigital number, since it uses as much as digits as its factorization.
231130122233093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 35.
The spelling of 231130122233093 in words is "two hundred thirty-one trillion, one hundred thirty billion, one hundred twenty-two million, two hundred thirty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •