Base | Representation |
---|---|
bin | 110100010100101110111011… |
… | …110010100000011110001101 |
3 | 1010011210120012201010112221012 |
4 | 310110232323302200132031 |
5 | 220130314310023110411 |
6 | 2133233050135415005 |
7 | 66320565335034521 |
oct | 6424567362403615 |
9 | 1104716181115835 |
10 | 230123203331981 |
11 | 6736277aa88223 |
12 | 21987503224465 |
13 | 9b536a944c7ab |
14 | 40b804592bd81 |
15 | 1b9107517918b |
hex | d14bbbca078d |
230123203331981 has 2 divisors, whose sum is σ = 230123203331982. Its totient is φ = 230123203331980.
The previous prime is 230123203331927. The next prime is 230123203332017. The reversal of 230123203331981 is 189133302321032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118681610903881 + 111441592428100 = 10894109^2 + 10556590^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230123203331981 is a prime.
It is a super-2 number, since 2×2301232033319812 (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 (230123203337981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115061601665990 + 115061601665991.
It is an arithmetic number, because the mean of its divisors is an integer number (115061601665991).
Almost surely, 2230123203331981 is an apocalyptic number.
It is an amenable number.
230123203331981 is a deficient number, since it is larger than the sum of its proper divisors (1).
230123203331981 is an equidigital number, since it uses as much as digits as its factorization.
230123203331981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 41.
The spelling of 230123203331981 in words is "two hundred thirty trillion, one hundred twenty-three billion, two hundred three million, three hundred thirty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •