Base | Representation |
---|---|
bin | 11011011011101… |
… | …00000100011001 |
3 | 121000222222110111 |
4 | 31231310010121 |
5 | 432402113221 |
6 | 34500044321 |
7 | 5462635006 |
oct | 1555640431 |
9 | 530888414 |
10 | 230113561 |
11 | 1089907a7 |
12 | 650936a1 |
13 | 3889bb92 |
14 | 227c08ad |
15 | 15306be1 |
hex | db74119 |
230113561 has 2 divisors, whose sum is σ = 230113562. Its totient is φ = 230113560.
The previous prime is 230113519. The next prime is 230113567. The reversal of 230113561 is 165311032.
It is a happy number.
230113561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 228947161 + 1166400 = 15131^2 + 1080^2 .
It is a cyclic number.
It is not a de Polignac number, because 230113561 - 211 = 230111513 is a prime.
It is a super-2 number, since 2×2301135612 = 105904501912201442, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (230113567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115056780 + 115056781.
It is an arithmetic number, because the mean of its divisors is an integer number (115056781).
Almost surely, 2230113561 is an apocalyptic number.
It is an amenable number.
230113561 is a deficient number, since it is larger than the sum of its proper divisors (1).
230113561 is an equidigital number, since it uses as much as digits as its factorization.
230113561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 230113561 is about 15169.4944213708. The cubic root of 230113561 is about 612.7933885845.
Adding to 230113561 its reverse (165311032), we get a palindrome (395424593).
The spelling of 230113561 in words is "two hundred thirty million, one hundred thirteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •