Base | Representation |
---|---|
bin | 110100010110001100001101… |
… | …101110010001000101010101 |
3 | 1010012011010201221201012222122 |
4 | 310112030031232101011111 |
5 | 220133434421210344033 |
6 | 2133351052535505325 |
7 | 66331042351256006 |
oct | 6426141556210525 |
9 | 1105133657635878 |
10 | 230223362199893 |
11 | 673a11a8062117 |
12 | 219a29b6228245 |
13 | 9b5cc7bb445ca |
14 | 40bcc27b051ad |
15 | 1b939882e5a98 |
hex | d1630db91155 |
230223362199893 has 2 divisors, whose sum is σ = 230223362199894. Its totient is φ = 230223362199892.
The previous prime is 230223362199823. The next prime is 230223362199899. The reversal of 230223362199893 is 398991263322032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 229171820650084 + 1051541549809 = 15138422^2 + 1025447^2 .
It is a cyclic number.
It is not a de Polignac number, because 230223362199893 - 28 = 230223362199637 is a prime.
It is a super-2 number, since 2×2302233621998932 (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 (230223362199899) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115111681099946 + 115111681099947.
It is an arithmetic number, because the mean of its divisors is an integer number (115111681099947).
Almost surely, 2230223362199893 is an apocalyptic number.
It is an amenable number.
230223362199893 is a deficient number, since it is larger than the sum of its proper divisors (1).
230223362199893 is an equidigital number, since it uses as much as digits as its factorization.
230223362199893 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45349632, while the sum is 62.
The spelling of 230223362199893 in words is "two hundred thirty trillion, two hundred twenty-three billion, three hundred sixty-two million, one hundred ninety-nine thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •