Base | Representation |
---|---|
bin | 1101011001100100000… |
… | …1011111110100101111 |
3 | 211000012001222202121201 |
4 | 3112121001133310233 |
5 | 12232422321320411 |
6 | 253430325110331 |
7 | 22426404405316 |
oct | 3263101376457 |
9 | 730161882551 |
10 | 230200573231 |
11 | 8969a249932 |
12 | 387458583a7 |
13 | 1892810c455 |
14 | b1db01b27d |
15 | 5ec49bc3c1 |
hex | 359905fd2f |
230200573231 has 2 divisors, whose sum is σ = 230200573232. Its totient is φ = 230200573230.
The previous prime is 230200573199. The next prime is 230200573321. The reversal of 230200573231 is 132375002032.
Together with next prime (230200573321) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 230200573231 - 25 = 230200573199 is a prime.
It is a super-2 number, since 2×2302005732312 (a number of 24 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 230200573231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230200073231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115100286615 + 115100286616.
It is an arithmetic number, because the mean of its divisors is an integer number (115100286616).
Almost surely, 2230200573231 is an apocalyptic number.
230200573231 is a deficient number, since it is larger than the sum of its proper divisors (1).
230200573231 is an equidigital number, since it uses as much as digits as its factorization.
230200573231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7560, while the sum is 28.
Adding to 230200573231 its reverse (132375002032), we get a palindrome (362575575263).
The spelling of 230200573231 in words is "two hundred thirty billion, two hundred million, five hundred seventy-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •