Base | Representation |
---|---|
bin | 110100010110010101010011… |
… | …100001100100011101111011 |
3 | 1010012012001221012202222011101 |
4 | 310112111103201210131323 |
5 | 220134114414020224011 |
6 | 2133355345304112231 |
7 | 66331536264426505 |
oct | 6426252341443573 |
9 | 1105161835688141 |
10 | 230233123211131 |
11 | 673a5356984357 |
12 | 219a487b165677 |
13 | 9b60b761762c1 |
14 | 40bd4b2216d75 |
15 | 1b93d5a1e72c1 |
hex | d1655386477b |
230233123211131 has 2 divisors, whose sum is σ = 230233123211132. Its totient is φ = 230233123211130.
The previous prime is 230233123211123. The next prime is 230233123211317. The reversal of 230233123211131 is 131112321332032.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 230233123211131 - 23 = 230233123211123 is a prime.
It is a super-2 number, since 2×2302331232111312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 230233123211131.
It is not a weakly prime, because it can be changed into another prime (230233123211731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115116561605565 + 115116561605566.
It is an arithmetic number, because the mean of its divisors is an integer number (115116561605566).
Almost surely, 2230233123211131 is an apocalyptic number.
230233123211131 is a deficient number, since it is larger than the sum of its proper divisors (1).
230233123211131 is an equidigital number, since it uses as much as digits as its factorization.
230233123211131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 230233123211131 its reverse (131112321332032), we get a palindrome (361345444543163).
The spelling of 230233123211131 in words is "two hundred thirty trillion, two hundred thirty-three billion, one hundred twenty-three million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •