Base | Representation |
---|---|
bin | 11011011011100… |
… | …11011100101111 |
3 | 121000222211222111 |
4 | 31231303130233 |
5 | 432402023043 |
6 | 34500024451 |
7 | 5462624422 |
oct | 1555633457 |
9 | 530884874 |
10 | 230111023 |
11 | 1089898aa |
12 | 65092127 |
13 | 3889a98c |
14 | 227bd9b9 |
15 | 1530609d |
hex | db7372f |
230111023 has 2 divisors, whose sum is σ = 230111024. Its totient is φ = 230111022.
The previous prime is 230111003. The next prime is 230111059. The reversal of 230111023 is 320111032.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 230111023 - 217 = 229979951 is a prime.
It is a super-2 number, since 2×2301110232 = 105902165812213058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230110994 and 230111012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230111003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115055511 + 115055512.
It is an arithmetic number, because the mean of its divisors is an integer number (115055512).
Almost surely, 2230111023 is an apocalyptic number.
230111023 is a deficient number, since it is larger than the sum of its proper divisors (1).
230111023 is an equidigital number, since it uses as much as digits as its factorization.
230111023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 230111023 is about 15169.4107664075. The cubic root of 230111023 is about 612.7911356747.
Adding to 230111023 its reverse (320111032), we get a palindrome (550222055).
Subtracting 230111023 from its reverse (320111032), we obtain a palindrome (90000009).
The spelling of 230111023 in words is "two hundred thirty million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •